{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:09Z","timestamp":1761620829988,"version":"3.40.5"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Intelligence"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020043517392","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T13:24:27Z","timestamp":1047734667000},"page":"297-311","source":"Crossref","is-referenced-by-count":5,"title":["Querying Temporal Constraint Networks: A Unifying Approach"],"prefix":"10.1007","volume":"17","author":[{"given":"Manolis","family":"Koubarakis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"5095813_CR1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. Allen","year":"1983","unstructured":"J. Allen, \u201cMaintaining knowledge about temporal intervals,\u201d Communications of the ACM, vol. 26, no. 11, pp. 832\u2013843, 1983.","journal-title":"Communications of the ACM"},{"key":"5095813_CR2","unstructured":"M. Vilain and H. Kautz, \u201cConstraint propagation algorithms for temporal reasoning,\u201d in Proceedings of AAAI-86, 1986, pp. 377\u2013382."},{"key":"5095813_CR3","first-page":"373","volume-title":"Readings in Qualitative Reasoning about Physical Systems","author":"M. Vilain","year":"1989","unstructured":"M. Vilain, H. Kautz, and P. van Beek, \u201cConstraint propagation algorithms for temporal reasoning: A revised report,\u201d in Readings in Qualitative Reasoning about Physical Systems, edited by D. Weld and J. de Kleer, Morgan Kaufmann: San Mateo, CA, pp. 373\u2013381, 1989."},{"key":"5095813_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","volume":"6","author":"P. van Beek","year":"1990","unstructured":"P. van Beek and R. Cohen, \u201cExact and approximate reasoning about temporal relations,\u201d Computational Intelligence, vol. 6, pp. 132\u2013144, 1990.","journal-title":"Computational Intelligence"},{"issue":"1-3","key":"5095813_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl, \u201cTemporal constraint networks,\u201d Artificial Intelligence, vol. 49, nos. 1-3, pp. 61\u201395, 1991, Special volume on knowledge representation.","journal-title":"Artificial Intelligence"},{"key":"5095813_CR6","unstructured":"I. Meiri, \u201cCombining qualitative and quantitative constraints in temporal reasoning,\u201d in Proceedings of AAAI-91, 1991, pp. 260\u2013267."},{"key":"5095813_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","volume":"58","author":"P. van Beek","year":"1992","unstructured":"P. van Beek, \u201cReasoning about qualitative temporal information,\u201d Artificial Intelligence, vol. 58, pp. 297\u2013326, 1992.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"5095813_CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/176584.176585","volume":"41","author":"P. Ladkin","year":"1994","unstructured":"P. Ladkin and R. Maddux, \u201cOn binary constraint problems,\u201d Journal of the ACM, vol. 41, no. 3, pp. 435\u2013469, 1994.","journal-title":"Journal of the ACM"},{"issue":"1","key":"5095813_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"B. Nebel and H.-J. B\u00fcrckert, \u201cReasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra,\u201d Journal of the ACM, vol. 42, no. 1, pp. 43\u201366, 1995.","journal-title":"Journal of the ACM"},{"key":"5095813_CR10","doi-asserted-by":"crossref","unstructured":"V. Brusoni, L. Console, B. Pernici, and P. Terenziani, \u201cExtending temporal relational databases to deal with imprecise and qualitative temporal information,\u201d in Recent Advances in Temporal Databases (Proceedings of the International Workshop on Temporal Databases, Z\u00fcrich, Switzerland, September 1995), edited by J. Clifford and A. Tuzhilin. Workshops in Computing. Springer, 1995.","DOI":"10.1007\/978-1-4471-3033-8_1"},{"key":"5095813_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(94)00016-T","volume":"74","author":"A. Gerevini","year":"1995","unstructured":"A. Gerevini and L. Schubert, \u201cEfficient algorithms for qualitative reasoning about time,\u201d Artificial Intelligence, vol. 74, pp. 207\u2013248, 1995.","journal-title":"Artificial Intelligence"},{"key":"5095813_CR12","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, \u201cFrom local to global consistency in temporal constraint networks,\u201d in Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France, vol. 976 of LNCS, pp. 53\u201369, 1995.","DOI":"10.1007\/3-540-60299-2_4"},{"key":"5095813_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(96)00192-2","volume":"173","author":"M. Koubarakis","year":"1997","unstructured":"M. Koubarakis, \u201cFrom local to global consistency in temporal constraint networks,\u201d Theoretical Computer Science, vol. 173, pp. 89\u2013112, 1997. Invited submission to the special issue dedicated to the 1st International Conference on Principles and Practice of Constraint Programming (CP95), edited by U. Montanari and F. Rossi.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR14","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, \u201cTractable disjunctions of linear constraints,\u201d in Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP'96), Boston, MA, 1996, pp. 297\u2013307.","DOI":"10.1007\/3-540-61551-2_82"},{"key":"5095813_CR15","unstructured":"P. Jonsson and C. B\u00e4ckstr\u00f6m, \u201cA linear programming approach to temporal reasoning,\u201d in Proceedings of AAAI-96, 1996, AAAI Press\/MIT Press, pp. 1235\u20131240."},{"key":"5095813_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0004-3702(98)00031-9","volume":"102","author":"P. Jonsson","year":"1998","unstructured":"P. Jonsson and C. B\u00e4ckstr\u00f6m, \u201cA unifying approach to temporal constraint reasoning,\u201d Artificial Intelligence, vol. 102, pp. 143\u2013155, 1998.","journal-title":"Artificial Intelligence"},{"key":"5095813_CR17","unstructured":"S. Staab, \u201cOn non-binary temporal relations,\u201d in Proceedings of ECAI-98, 1998, pp. 567\u2013571."},{"issue":"3","key":"5095813_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/152947.152953","volume":"4","author":"A. Gerevini","year":"1993","unstructured":"A. Gerevini, L. Schubert, and S. Schaeffer, \u201cTemporal reasoning in timegraph I-II,\u201d SIGART Bulletin, vol. 4, no. 3, pp. 21\u201325, 1993.","journal-title":"SIGART Bulletin"},{"issue":"3","key":"5095813_CR19","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/152947.152954","volume":"4","author":"E. Yampratoom","year":"1993","unstructured":"E. Yampratoom and J. Allen, \u201cPerformance of temporal reasoning systems,\u201d SIGART Bulletin, vol. 4, no. 3, pp. 26\u201329, 1993.","journal-title":"SIGART Bulletin"},{"key":"5095813_CR20","doi-asserted-by":"crossref","unstructured":"J. Stillman, R. Arthur, and A. Deitsch, \u201cTachyon: A constraintbased temporal reasoning model and its implementation,\u201d SIGART Bulletin, vol. 4, no. 3, 1993.","DOI":"10.1145\/152947.1064735"},{"issue":"4","key":"5095813_CR21","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/64.608197","volume":"12","author":"V. Brusoni","year":"1997","unstructured":"V. Brusoni, L. Console, B. Pernici, and P. Terenziani, \u201cLaTeR: An efficient, general purpose manager of temporal information,\u201d IEEE Expert, vol. 12, no. 4, pp. 56\u201364, 1997.","journal-title":"IEEE Expert"},{"key":"5095813_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems","author":"V. Brusoni","year":"1994","unstructured":"V. Brusoni, L. Console, B. Pernici, and P. Terenziani, \u201cLaTeR: A general purpose manager of temporal information,\u201d in Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, vol. 869 of Lecture Notes in Computer Science, Springer-Verlag: Berlin, 1994."},{"key":"5095813_CR23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0933-3657(91)90004-U","volume":"3","author":"P. van Beek","year":"1991","unstructured":"P. van Beek, \u201cTemporal query processing with indefinite information,\u201d Artificial Intelligence in Medicine, vol. 3, pp. 325\u2013339, 1991.","journal-title":"Artificial Intelligence in Medicine"},{"issue":"4","key":"5095813_CR24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/102675.102676","volume":"8","author":"J. Mylopoulos","year":"1990","unstructured":"J. Mylopoulos, A. Borgida, M. Jarke, and M. Koubarakis, \u201cTelos: A language for representing knowledge about information systems,\u201d ACM Transactions on Information Systems, vol. 8, no. 4, pp. 325\u2013362, 1990.","journal-title":"ACM Transactions on Information Systems"},{"key":"5095813_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90061-0","volume":"32","author":"T. Dean","year":"1987","unstructured":"T. Dean and D. McDermott, \u201cTemporal data base management,\u201d Artificial Intelligence, vol. 32, pp. 1\u201355, 1987.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"5095813_CR26","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/76359.76360","volume":"36","author":"T. Dean","year":"1989","unstructured":"T. Dean, \u201cUsing temporal hierarchies to efficiently maintain large temporal databases,\u201d Journal of ACM, vol. 36, no. 4, pp. 687\u2013718, 1989.","journal-title":"Journal of ACM"},{"key":"5095813_CR27","unstructured":"R. Schrag, M. Boddy, and J. Carciofini, \u201cManaging disjunction for practical temporal reasoning,\u201d in Proceedings of KR'92, 1992, pp. 36\u201346."},{"issue":"3","key":"5095813_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/152947.152952","volume":"4","author":"M. Boddy","year":"1993","unstructured":"M. Boddy, \u201cTemporal reasoning for planning and scheduling,\u201d SIGART Bulletin, vol. 4, no. 3, pp. 17\u201320, 1993.","journal-title":"SIGART Bulletin"},{"key":"5095813_CR29","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, \u201cRepresentation and querying in temporal databases: The power of temporal constraints,\u201d in Proceedings of the 9th International Conference on Data Engineering, 1993, pp. 327\u2013334.","DOI":"10.1109\/ICDE.1993.344049"},{"issue":"2","key":"5095813_CR30","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0306-4379(94)90008-6","volume":"19","author":"M. Koubarakis","year":"1994","unstructured":"M.Koubarakis, \u201cDatabase models for infinite and indefinite temporal information,\u201d Information Systems, vol. 19, no. 2, pp. 141\u2013173, 1994.","journal-title":"Information Systems"},{"issue":"2","key":"5095813_CR31","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(95)00008-3","volume":"74","author":"V. Brusoni","year":"1995","unstructured":"V. Brusoni, L. Console, and P. Terenziani, \u201cOn the computational complexity of querying bounds on differences constraints,\u201d Artificial Intelligence, vol. 74, no. 2, pp. 367\u2013379, 1995.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"5095813_CR32","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/69.824613","volume":"1","author":"V. Brusoni","year":"1999","unstructured":"V. Brusoni, L. Console, P. Terenziani, and B. Pernici, \u201cQualitative and quantitative temporal constraints and relational databases: Theory, architecture, and applications,\u201d IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 6, pp. 948\u2013968, 1999.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5095813_CR33","unstructured":"P. Ladkin, \u201cSatisfying first-order constraints about time intervals,\u201d in Proceedings of AAAI-88, 1988, pp. 512\u2013517."},{"key":"5095813_CR34","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/B978-1-4832-1452-8.50131-7","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR'94)","author":"M. Koubarakis","year":"1994","unstructured":"M. Koubarakis, \u201cComplexity results for first-order theories of temporal constraints,\u201d in Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR'94), 1994, Morgan Kaufmann: San Francisco, CA, pp. 379\u2013390."},{"key":"5095813_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0304-3975(96)00124-7","volume":"171","author":"M. Koubarakis","year":"1997","unstructured":"M. Koubarakis, \u201cThe complexity of query evaluation in indefinite temporal constraint databases,\u201d Theoretical Computer Science, vol. 171, pp. 25\u201360, 1997. Special issue on Uncertainty in Databases and Deductive Systems, edited by L.V.S. Lakshmanan.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR36","volume-title":"A Mathematical Introduction to Logic","author":"H. Enderton","year":"1972","unstructured":"H. Enderton, A Mathematical Introduction to Logic, Academic Press: New York, 1972."},{"volume-title":"Theory of Integer and Linear Programming","year":"1986","key":"5095813_CR37","unstructured":"A. Schrijver (ed.), Theory of Integer and Linear Programming, Wiley: New York, 1986."},{"key":"5095813_CR38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0304-3975(00)00177-8","volume":"266","author":"M. Koubarakis","year":"2001","unstructured":"M. Koubarakis, \u201cTractable disjunctions of linear constraints: Basic results and applications to temporal reasoning,\u201d Theoretical Computer Science, vol. 266, pp. 311\u2013339, 2001.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"5095813_CR39","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1111\/0824-7935.00101","volume":"15","author":"L. Console","year":"1999","unstructured":"L. Console and P. Terenziani, \u201cEfficient processing of queries and assertions about qualitative and quantitative temporal constraints,\u201d Computational Intelligence, vol. 15, no. 4, pp. 442\u2013465, 1999.","journal-title":"Computational Intelligence"},{"key":"5095813_CR40","unstructured":"R. Dechter, I. Meiri, and J. Pearl, \u201cTemporal constraint networks,\u201d in Proceedings of 1st International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Ontario, edited by R. Brachman, H. Levesque, and R. Reiter, pp. 83\u201393, 1989."},{"key":"5095813_CR41","unstructured":"A. Gerevini and M. Cristani, \u201cReasoning with inequations in temporal constraint networks,\u201d Technical report, IRST- Instituto per la Ricerca Scientifica e Tecnologica, Povo TN, Italy, 1995. A shorter version appeared in the Proceedings of the Workshop on Spatial and Temporal Reasoning, IJCAI-95."},{"key":"5095813_CR42","unstructured":"H. Kautz and P. Ladkin, \u201cIntegrating metric and qualitative temporal reasoning,\u201d in Proceedings of AAAI-91, 1991, pp. 241\u2013246."},{"key":"5095813_CR43","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(94)90110-4","volume":"70","author":"A. Gerevini","year":"1994","unstructured":"A. Gerevini and L. Schubert, \u201cOn point-based temporal disjointness,\u201d Artificial Intelligence, vol. 70, pp. 347\u2013361, 1994.","journal-title":"Artificial Intelligence"},{"key":"5095813_CR44","unstructured":"M. Fischer and M. Rabin, \u201cSuper-exponential complexity of presburger arithmetic,\u201d in Proc. of AMS Symposium on Complexity of Real Computational Processes, 1974, vol. III."},{"issue":"1","key":"5095813_CR45","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0204006","volume":"4","author":"J. Ferrante","year":"1975","unstructured":"J. Ferrante and C. Rackoff, \u201cA decision procedure for the first order theory of real addition with order,\u201d SIAM Journal on Computing, vol. 4, no. 1, pp. 69\u201376, 1975.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5095813_CR46","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(77)90037-8","volume":"4","author":"J. Ferrante","year":"1977","unstructured":"J. Ferrante and J. Geiser, \u201cAn efficient decision procedure for the theory of rational order,\u201d Theoretical Computer Science, vol. 4, no. 2, pp. 227\u2013233, 1977.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer, \u201cThe polynomial-time hierarchy,\u201d Theoretical Computer Science, vol. 3, pp. 1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR48","doi-asserted-by":"crossref","unstructured":"C. Reddy and D. Loveland, \u201cPresburger arithmetic with bounded quantifier alternation,\u201d in Proc. of ACM Symposium on the Theory of Computing, 1978, pp. 320\u2013325.","DOI":"10.1145\/800133.804361"},{"key":"5095813_CR49","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","volume-title":"The Computational Complexity of Logical Theories","author":"J. Ferrante","year":"1979","unstructured":"J. Ferrante and C. Rackoff, The Computational Complexity of Logical Theories, Lecture Notes in Mathematics, Springer Verlag: Berlin, 1979."},{"key":"5095813_CR50","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","volume":"11","author":"L. Berman","year":"1980","unstructured":"L. Berman, \u201cThe complexity of logical theories,\u201d Theoretical Computer Science, vol. 11, pp. 71\u201378, 1980.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR51","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(80)90036-5","volume":"11","author":"A. Bruss","year":"1980","unstructured":"A. Bruss and A. Meyer, \u201cOn time-space classes and their relation to the theory of real addition,\u201d Theoretical Computer Science, vol. 11, pp. 59\u201369, 1980.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR52","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90115-3","volume":"18","author":"M. Furer","year":"1982","unstructured":"M. Furer, \u201cThe complexity of presburger arithmetic with bounded quantifier alternation depth,\u201d Theoretical Computer Science, vol. 18, pp. 105\u2013111, 1982.","journal-title":"Theoretical Computer Science"},{"key":"5095813_CR53","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","volume":"20","author":"E. Sontag","year":"1985","unstructured":"E. Sontag, \u201cReal addition and the polynomial time hierarchy,\u201d Information Processing Letters, vol. 20, pp. 115\u2013120, 1985.","journal-title":"Information Processing Letters"},{"key":"5095813_CR54","doi-asserted-by":"crossref","unstructured":"P. Kanellakis, G. Kuper, and P. Revesz, \u201cConstraint query languages,\u201d in Proceedings of the 9th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, 1990, pp. 299\u2013313.","DOI":"10.1145\/298514.298582"},{"key":"5095813_CR55","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-1-4612-5196-5_8","volume-title":"On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages","author":"R. Reiter","year":"1984","unstructured":"R. Reiter, \u201cTowards a logical reconstruction of relational database theory,\u201d in On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, edited by M. Brodie, J. Mylopoulos, and J. Schmidt, Springer Verlag: Berlin, pp. 191\u2013233, 1984."},{"issue":"4","key":"5095813_CR56","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski and W. Lipski, \u201cIncomplete information in relational databases,\u201d Journal of ACM, vol. 31, no. 4, pp. 761\u2013791, 1984.","journal-title":"Journal of ACM"},{"key":"5095813_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54919-6","volume-title":"The Problem of Incomplete Information in Relational Databases","author":"G. Grahne","year":"1991","unstructured":"G. Grahne, The Problem of Incomplete Information in Relational Databases, vol. 554 of Lecture Notes in Computer Science, Springer Verlag: Berlin, 1991."},{"key":"5095813_CR58","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(84)90009-2","volume":"23","author":"H. Levesque","year":"1984","unstructured":"H. Levesque, \u201cFoundations of a functional approach to knowledge representation,\u201d Artificial Intelligence, vol. 23, pp. 155\u2013212, 1984.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"5095813_CR59","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320083.320088","volume":"4","author":"W.J. Lipski","year":"1979","unstructured":"W.J. Lipski, \u201cOn semantic issues connected with incomplete information databases,\u201d ACM Transactions on Database Systems, vol. 4, no. 3, pp. 262\u2013296, 1979.","journal-title":"ACM Transactions on Database Systems"},{"key":"5095813_CR60","unstructured":"R. Reiter, \u201cOn integrity constraints,\u201d in Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge. Asilomar, CA, 1988, pp. 97\u2013111."},{"key":"5095813_CR61","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P. Kanellakis","year":"1995","unstructured":"P. Kanellakis, G. Kuper, and P. Revesz, \u201cConstraint query languages,\u201d Journal of Computer and System Sciences, vol. 51, pp. 26\u201352, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"5095813_CR62","unstructured":"M. Koubarakis and S. Skiadopoulos, \u201cQuerying temporal constraint networks in PTIME,\u201d in Proceedings of AAAI-99, 1999. pp. 745\u2013750."},{"key":"5095813_CR63","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-48344-6_12","volume-title":"Spatio-Temporal Database Management (Proceedings of the International Workshop STDBM'99)","author":"M. Koubarakis","year":"1999","unstructured":"M. Koubarakis and S. Skiadopoulos, \u201cTractable query answering in indefinite constraint databases: Basic results and applications to querying spatio-temporal information,\u201d in Spatio-Temporal Database Management (Proceedings of the International Workshop STDBM'99), vol. 1678 of LNCS, Springer: Berlin, pp. 204\u2013223, 1999."},{"key":"5095813_CR64","unstructured":"M. Koubarakis and S. Skiadopoulos, \u201cQuerying indefinite temporal and spatial information: A new frontier,\u201d in Proceedings of the IJCAI-99 Workshop on Hot Topics in Temporal and Spatial Reasoning, 1999."},{"issue":"1\/2","key":"5095813_CR65","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0004-3702(00)00055-2","volume":"123","author":"M. Koubarakis","year":"2000","unstructured":"M. Koubarakis and S. Skiadopoulos, \u201cQuerying temporal and spatial constraint networks in PTIME,\u201d Artificial Intelligence, vol. 123, nos. 1\/2, pp. 223\u2013263, 2000.","journal-title":"Artificial Intelligence"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020043517392.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020043517392\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020043517392.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:48:52Z","timestamp":1747579732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020043517392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5095813"],"URL":"https:\/\/doi.org\/10.1023\/a:1020043517392","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}