{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:55:54Z","timestamp":1761620154926,"version":"build-2065373602"},"reference-count":111,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444527264"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80023-4","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"665-697","source":"Crossref","is-referenced-by-count":5,"title":["Temporal CSPs"],"prefix":"10.1016","member":"78","reference":[{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(51)90007-2","article-title":"On the Representation and Querying of Sets of Possible Worlds","volume":"78","author":"Abiteboul","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1574-6526(06)80023-4_bib2","first-page":"3","article-title":"Representing and reasoning with temporal constraints in multimedia presentations","author":"Adali","year":"2000","journal-title":"TIME"},{"issue":"11","key":"10.1016\/S1574-6526(06)80023-4_bib3","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining Knowledge about Temporal Intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Communications of the ACM"},{"year":"1991","series-title":"Reasoning About Plans","key":"10.1016\/S1574-6526(06)80023-4_bib4"},{"key":"10.1016\/S1574-6526(06)80023-4_bib5","series-title":"CAV","first-page":"8","article-title":"Timed automata","author":"Alur","year":"1999"},{"key":"10.1016\/S1574-6526(06)80023-4_bib6","series-title":"ECP","first-page":"97","article-title":"SAT-based procedures for temporal reasoning","author":"Armando","year":"1999"},{"key":"10.1016\/S1574-6526(06)80023-4_bib7","article-title":"A SAT-based decision procedure for the Boolean combination of difference constraints","author":"Armando","year":"2004","journal-title":"SAT"},{"key":"10.1016\/S1574-6526(06)80023-4_bib8","first-page":"195","article-title":"A SAT based approach for solving formulas over Boolean and linear mathematical propositions","author":"Audemard","year":"2002","journal-title":"CADE"},{"key":"10.1016\/S1574-6526(06)80023-4_bib9","first-page":"23","article-title":"Reasoning about generalized intervals: Horn representability and tractability","author":"Balbiani","year":"2000","journal-title":"TIME"},{"key":"10.1016\/S1574-6526(06)80023-4_bib10","first-page":"203","article-title":"On the consistency problem for the INDU calculus","author":"Balbiani","year":"2003","journal-title":"TIME"},{"key":"10.1016\/S1574-6526(06)80023-4_bib11","first-page":"134","article-title":"Solving over-constrained temporal reasoning problems using local search","author":"Beaumont","year":"2004","journal-title":"PRICAI"},{"key":"10.1016\/S1574-6526(06)80023-4_bib12","first-page":"3","article-title":"Global consistency in Interval Algebra networks: Tractable subclasses","author":"Bessi\u00e8re","year":"1996","journal-title":"ECAI"},{"issue":"1\/2","key":"10.1016\/S1574-6526(06)80023-4_bib13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0004-3702(02)00223-0","article-title":"Solving multi-granularity temporal constraint networks","volume":"140","author":"Bettini","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib14","first-page":"456","article-title":"Path consistency on triangulated constraint graphs","author":"Bliek","year":"1999","journal-title":"IJCAI"},{"key":"10.1016\/S1574-6526(06)80023-4_bib15","first-page":"513","article-title":"A method for metric temporal reasoning","author":"Broxvall","year":"2002","journal-title":"AAAI\/IAAI"},{"issue":"2","key":"10.1016\/S1574-6526(06)80023-4_bib16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(03)00075-4","article-title":"Point algebras for temporal reasoning: Algorithms and complexity","volume":"149","author":"Broxvall","year":"2003","journal-title":"Artificial Intelligence"},{"issue":"1\/2","key":"10.1016\/S1574-6526(06)80023-4_bib17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0004-3702(02)00224-2","article-title":"Disjunctions, independence, refinements","volume":"140","author":"Broxvall","year":"2002","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/64.608197","article-title":"LaTeR: an efficient, general purpose manager of temporal information","volume":"12","author":"Brusoni","year":"1997","journal-title":"IEEE Expert"},{"issue":"2","key":"10.1016\/S1574-6526(06)80023-4_bib19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(95)00008-3","article-title":"On the computational complexity of querying bounds on differences constraints","volume":"74","author":"Brusoni","year":"1995","journal-title":"Artificial Intelligence"},{"issue":"6","key":"10.1016\/S1574-6526(06)80023-4_bib20","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/69.824613","article-title":"Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications","volume":"1","author":"Brusoni","year":"1999","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S1574-6526(06)80023-4_bib21","first-page":"13","article-title":"Managing dynamic temporal constraint networks","author":"Cervoni","year":"1994","journal-title":"AIPS"},{"key":"10.1016\/S1574-6526(06)80023-4_bib22","article-title":"Gaining efficiency and flexibility in the simple temporal problem","author":"Cesta","year":"1996","journal-title":"TIME"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","article-title":"A constraint-based method for project scheduling with time windows","volume":"8","author":"Cesta","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80023-4_bib24","series-title":"Proceedings of CONSTRAINTS-95","first-page":"40","article-title":"Efficient algorithms for networks of quantitative temporal constraints","author":"Chleq","year":"1995"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib25","first-page":"213","article-title":"An efficient consistency algorithm for the temporal constraint satisfaction problem","volume":"17","author":"Choueiry","year":"2004","journal-title":"AI Communications"},{"issue":"5","key":"10.1016\/S1574-6526(06)80023-4_bib26","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1145\/355483.355485","article-title":"Building tractable disjunctive constraints","volume":"47","author":"Cohen","year":"2000","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80023-4_bib27","first-page":"478","article-title":"Tractable disjunctive constraints","author":"Cohen","year":"1997","journal-title":"CP"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib28","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1111\/0824-7935.00101","article-title":"Efficient processing of queries and assertions about qualitative and quantitative temporal constraints","volume":"15","author":"Console","year":"1999","journal-title":"Computational Intelligence"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S1574-6526(06)80023-4_bib29"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib30","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/76359.76360","article-title":"Using temporal hierarchies to efficiently maintain large temporal databases","volume":"36","author":"Dean","year":"1989","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90061-0","article-title":"Temporal Data Base Management","volume":"32","author":"Dean","year":"1987","journal-title":"Artificial Intelligence"},{"year":"2003","series-title":"Constraint Processing","author":"Dechter","key":"10.1016\/S1574-6526(06)80023-4_bib32"},{"key":"10.1016\/S1574-6526(06)80023-4_bib33","first-page":"83","article-title":"Temporal Constraint Networks","author":"Dechter","year":"1989","journal-title":"KR"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(06)80023-4_bib34","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal Constraint Networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib35","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0304-3975(97)86737-0","article-title":"Local and global relational consistency","volume":"173","author":"Dechter","year":"1997","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"10.1016\/S1574-6526(06)80023-4_bib36","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(01)00278-2","article-title":"Updating <=, <-chains","volume":"82","author":"Delgrande","year":"2002","journal-title":"Information Processing Letters"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib37","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(01)00119-9","article-title":"A comparison of point-based approaches to qualitative temporal reasoning","volume":"131","author":"Delgrande","year":"2001","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S1574-6526(06)80023-4_bib38","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0004-3702(98)00093-9","article-title":"A complete classification of tractability in allen's algebra relative to subsets of basic relations","volume":"106","author":"Drakengren","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib39","first-page":"335","article-title":"Valid-time Indeterminacy","author":"Dyreson","year":"1993","journal-title":"ICDE"},{"year":"1972","series-title":"A Mathematical Introduction to Logic","author":"Enderton","key":"10.1016\/S1574-6526(06)80023-4_bib40"},{"year":"2005","series-title":"Handbook of Temporal Reasoning in Artificial Intelligence","key":"10.1016\/S1574-6526(06)80023-4_bib41"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib42","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.artint.2005.04.005","article-title":"Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class","volume":"166","author":"Gerevini","year":"2005","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib43","series-title":"Technical report, IRST \u2014 Instituto per la Ricerca Scientifica e Tecnologica","article-title":"Reasoning with Inequations in Temporal Constraint Networks","author":"Gerevini","year":"1995"},{"key":"10.1016\/S1574-6526(06)80023-4_bib44","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(94)00016-T","article-title":"Efficient Algorithms for Qualitative Reasoning about Time","volume":"74","author":"Gerevini","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib45","first-page":"1297","article-title":"Managing Efficiently Temporal Relations through Indexed Spanning Trees","author":"Ghallab","year":"1989","journal-title":"IJCAI"},{"key":"10.1016\/S1574-6526(06)80023-4_bib46","article-title":"Look-ahead vs. look-back techniques in a modern SAT solver","author":"Giunchiglia","year":"2003","journal-title":"SAT"},{"year":"1997","series-title":"Tabu Search","author":"Glover","key":"10.1016\/S1574-6526(06)80023-4_bib47"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib48","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/1634.1886","article-title":"Incomplete Information in Relational Databases","volume":"31","author":"Imielinski","year":"1984","journal-title":"Journal of ACM"},{"key":"10.1016\/S1574-6526(06)80023-4_bib49","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0004-3702(98)00031-9","article-title":"A unifying approach to temporal constraint reasoning","volume":"102","author":"Jonsson","year":"1998","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib50","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.artint.2004.05.010","article-title":"Complexity classification in qualitative temporal constraint reasoning","volume":"160","author":"Jonsson","year":"2004","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib51","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1995.1049","article-title":"Handling Infinite Temporal Data","volume":"51","author":"Kabanza","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1574-6526(06)80023-4_bib52","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jcss.1995.1051","article-title":"Constraint Query Languages","volume":"51","author":"Kanellakis","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1574-6526(06)80023-4_bib53","first-page":"241","article-title":"Integrating Metric and Qualitative Temporal Reasoning","author":"Kautz","year":"1991","journal-title":"AAAI"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib54","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","article-title":"A theoretical evaluation of selected backtracking algorithms","volume":"89","author":"Kondrak","year":"1997","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S1574-6526(06)80023-4_bib55","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0306-4379(94)90008-6","article-title":"Database Models for Infinite and Indefinite Temporal Information","volume":"19","author":"Koubarakis","year":"1994","journal-title":"Information Systems"},{"key":"10.1016\/S1574-6526(06)80023-4_bib56","first-page":"297","article-title":"Tractable Disjunctions of Linear Constraints","author":"Koubarakis","year":"1996","journal-title":"CP"},{"key":"10.1016\/S1574-6526(06)80023-4_bib57","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(96)00192-2","article-title":"From Local to Global Consistency in Temporal Constraint Networks","volume":"173","author":"Koubarakis","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1574-6526(06)80023-4_bib58","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0304-3975(96)00124-7","article-title":"The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases","volume":"171","author":"Koubarakis","year":"1997","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib59","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0304-3975(00)00177-8","article-title":"Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning","volume":"266","author":"Koubarakis","year":"2001","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S1574-6526(06)80023-4_bib60","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1020043517392","article-title":"Querying temporal constraint networks: A unifying approach","volume":"17","author":"Koubarakis","year":"2002","journal-title":"Applied Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib61","series-title":"Handbook of Temporal Reasoning in Artificial Intelligence","article-title":"Indefinite temporal databases with temporal information: Representational power and computational complexity","author":"Koubarakis","year":"2005"},{"volume":"volume 2520","year":"2003","series-title":"Spatio-Temporal Databases: The CHOROCHRONOS Approach","key":"10.1016\/S1574-6526(06)80023-4_bib62"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib63","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0004-3702(00)00055-2","article-title":"Querying Temporal and Spatial Constraint Networks in PTIME","volume":"123","author":"Koubarakis","year":"2000","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib64","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","article-title":"A Logic-based Calculus of Events","volume":"1","author":"Kowalski","year":"1986","journal-title":"New Generation Computing"},{"issue":"5","key":"10.1016\/S1574-6526(06)80023-4_bib65","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/876638.876639","article-title":"Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra","volume":"50","author":"Krokhin","year":"2003","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/S1574-6526(06)80023-4_bib66","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1137\/S0895480102410201","article-title":"Constraint satisfaction problems on intervals and lengths","volume":"17","author":"Krokhin","year":"2004","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S1574-6526(06)80023-4_bib67","series-title":"AAAI","first-page":"67","article-title":"A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions","author":"Kumar","year":"2004"},{"key":"10.1016\/S1574-6526(06)80023-4_bib68","series-title":"ICAPS","first-page":"110","article-title":"On the tractability of restricted disjunctive temporal problems","author":"Kumar","year":"2005"},{"key":"10.1016\/S1574-6526(06)80023-4_bib69","series-title":"IJCAI","first-page":"1643","article-title":"Planning with sharable resource constraints","author":"Laborie","year":"1995"},{"key":"10.1016\/S1574-6526(06)80023-4_bib70","series-title":"AAAI","first-page":"354","article-title":"Primitives and Units for Time Specification","author":"Ladkin","year":"1986"},{"key":"10.1016\/S1574-6526(06)80023-4_bib71","series-title":"AAAI","first-page":"512","article-title":"Satisfying First-Order constraints About Time Intervals","author":"Ladkin","year":"1988"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib72","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","article-title":"Effective solution of qualitative interval constraint problems","volume":"57","author":"Ladkin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib73","series-title":"IJCAI","first-page":"205","article-title":"Identifying conflicts in overconstrained temporal problems","author":"Liffiton","year":"2005"},{"key":"10.1016\/S1574-6526(06)80023-4_bib74","series-title":"Machine Intelligence","first-page":"463","article-title":"Some Philosophical Problems From the Standpoint of Artificial Intelligence","author":"McCarthy","year":"1969"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib75","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","volume":"87","author":"Meiri","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib76","series-title":"IJCAI","first-page":"242","article-title":"Applying local search to disjunctive temporal problems","author":"Moffitt","year":"2005"},{"issue":"2","key":"10.1016\/S1574-6526(06)80023-4_bib77","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","article-title":"Arc and path consistency revisited","volume":"28","author":"Mohr","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib78","series-title":"39th Design Automation Conference (DAC)","article-title":"Chaff: Engineering an efficient SAT solver","author":"Moskewicz","year":"2001"},{"issue":"4","key":"10.1016\/S1574-6526(06)80023-4_bib79","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/102675.102676","article-title":"Telos: A Language for Representing Knowledge About Information Systems","volume":"8","author":"Mylopoulos","year":"1990","journal-title":"ACM Transactions on Information Systems"},{"issue":"1\/2","key":"10.1016\/S1574-6526(06)80023-4_bib80","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0004-3702(02)00226-6","article-title":"On point-duration networks for temporal reasoning","volume":"140","author":"Navarrete","year":"2002","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S1574-6526(06)80023-4_bib81","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00137869","article-title":"Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class","volume":"1","author":"Nebel","year":"1997","journal-title":"Constraints"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib82","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/200836.200848","article-title":"Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra","volume":"42","author":"Nebel","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80023-4_bib83","series-title":"ECAI","first-page":"108","article-title":"Incremental forward checking for the disjunctive temporal problem","author":"Oddi","year":"2000"},{"key":"10.1016\/S1574-6526(06)80023-4_bib84","series-title":"Australian Joint Conference on Artificial Intelligence","first-page":"291","article-title":"INDU: An interval and duration network","author":"Pujari","year":"1999"},{"key":"10.1016\/S1574-6526(06)80023-4_bib85","series-title":"On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages","first-page":"191","article-title":"Towards a logical reconstruction of relational database theory","author":"Reiter","year":"1984"},{"year":"2001","series-title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","author":"Reiter","key":"10.1016\/S1574-6526(06)80023-4_bib86"},{"key":"10.1016\/S1574-6526(06)80023-4_bib87","series-title":"IJCAI","first-page":"51","article-title":"A Spatial Odyssey of the Interval Algebra: 1. Directed Intervals","author":"Renz","year":"2001"},{"key":"10.1016\/S1574-6526(06)80023-4_bib88","series-title":"CP","first-page":"534","article-title":"Weak composition for qualitative spatial and temporal reasoning","author":"Renz","year":"2005"},{"year":"2002","series-title":"Introduction to Constraint Databases","author":"Revesz","key":"10.1016\/S1574-6526(06)80023-4_bib89"},{"year":"1986","series-title":"Theory of Integer and Linear Programming","key":"10.1016\/S1574-6526(06)80023-4_bib90"},{"key":"10.1016\/S1574-6526(06)80023-4_bib91","series-title":"Natural Language Processing and Knowledge Representation: Language for Knowledge and Knowledge for Language","first-page":"111","article-title":"Episodic logic meets Little Red Riding Hood: A comprehensive, natural representation for language understanding","author":"Schubert","year":"2000"},{"key":"10.1016\/S1574-6526(06)80023-4_bib92","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(97)00009-X","article-title":"Processing disjunctions in temporal constraint networks","volume":"93","author":"Schwalb","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib93","series-title":"ICAPS Workshop on Constraint Programming for Planning and Scheduling","article-title":"Two approaches to semi-dynamic disjunctive temporal problems","author":"Schwartz","year":"2005"},{"key":"10.1016\/S1574-6526(06)80023-4_bib94","series-title":"AAAI","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S1574-6526(06)80023-4_bib95","series-title":"AAAI","first-page":"970","article-title":"Evaluating consistency algorithms for temporal metric constraints","author":"Shi","year":"2004"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib96","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(01)00068-6","article-title":"From binary temporal relations to non-binary ones and back","volume":"128","author":"Staab","year":"2001","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib97","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0004-3702(00)00019-9","article-title":"Backtracking algorithms for disjunctions of temporal constraints","volume":"120","author":"Stergiou","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib98","series-title":"CAV","first-page":"209","article-title":"Deciding separation formulas with SAT","author":"Strichman","year":"2002"},{"issue":"1","key":"10.1016\/S1574-6526(06)80023-4_bib99","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1093\/logcom\/14.1.93","article-title":"A local search approach to modelling and solving Interval Algebra problems","volume":"14","author":"Thornton","year":"2004","journal-title":"Journal of Logic and Computation"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80023-4_bib100","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","article-title":"Efficient solution techniques for disjunctive temporal reasoning problems","volume":"151","author":"Tsamardinos","year":"2003","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib101","series-title":"IJCAI","first-page":"1291","article-title":"Approximation Algorithms for Temporal Reasoning","author":"van Beek","year":"1989"},{"key":"10.1016\/S1574-6526(06)80023-4_bib102","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0933-3657(91)90004-U","article-title":"Temporal Query Processing with Indefinite Information","volume":"3","author":"van Beek","year":"1991","journal-title":"Artificial Intelligence in Medicine"},{"key":"10.1016\/S1574-6526(06)80023-4_bib103","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","article-title":"Reasoning About Qualitative Temporal Information","volume":"58","author":"van Beek","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib104","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","article-title":"Exact and Approximate Reasoning about Temporal Relations","volume":"6","author":"van Beek","year":"1990","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1574-6526(06)80023-4_bib105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.232","article-title":"The design and experimental analysis of algorithms for temporal reasoning","volume":"4","author":"van Beek","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"year":"1983","series-title":"The Logic of Time","author":"van Benthem","key":"10.1016\/S1574-6526(06)80023-4_bib106"},{"key":"10.1016\/S1574-6526(06)80023-4_bib107","series-title":"AAAI","first-page":"377","article-title":"Constraint Propagation Algorithms for Temporal Reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/S1574-6526(06)80023-4_bib108","series-title":"Readings in Qualitative Reasoning about Physical Systems","first-page":"373","article-title":"Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report","author":"Vilain","year":"1989"},{"key":"10.1016\/S1574-6526(06)80023-4_bib109","series-title":"AAAI","first-page":"197","article-title":"A system for reasoning about time","author":"Vilain","year":"1982"},{"key":"10.1016\/S1574-6526(06)80023-4_bib110","series-title":"CP","first-page":"754","article-title":"Improving backtrack search for solving the TCSP","author":"Xu","year":"2003"},{"key":"10.1016\/S1574-6526(06)80023-4_bib111","series-title":"TIME","first-page":"212","article-title":"A new efficient algorithm for solving the simple temporal problem","author":"Xu","year":"2003"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:51:44Z","timestamp":1761619904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":111,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80023-4","relation":{},"ISSN":["1574-6526"],"issn-type":[{"type":"print","value":"1574-6526"}],"subject":[],"published":{"date-parts":[[2006]]}}}