{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T00:04:20Z","timestamp":1792541060944,"version":"4.5.0"},"reference-count":62,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4954,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0004-3702(99)00071-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:57:34Z","timestamp":1027616254000},"page":"123-191","source":"Crossref","is-referenced-by-count":246,"title":["Using temporal logics to express search control knowledge for planning"],"prefix":"10.1016","volume":"116","author":[{"given":"Fahiem","family":"Bacchus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Froduald","family":"Kabanza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(99)00071-5_ID005","unstructured":"AIPS98, Artificial Intelligence Planning Systems 1998 planning competition. http:\/\/ftp.cs.yale.edu\/pub\/mcdermott\/aipscomp-results.html, 1998"},{"key":"10.1016\/S0004-3702(99)00071-5_ID006","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1215","article-title":"Planning for temporally extended goals","author":"Bacchus","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID007","series-title":"New Directions in AI Planning","first-page":"141","article-title":"Using temporal logic to control search in a forward chaining planner","author":"Bacchus","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID008","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1018985923441","article-title":"Planning for temporally extended goals","volume":"22","author":"Bacchus","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID009","series-title":"Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy","first-page":"432","article-title":"Modeling and agent's incomplete knowledge during planning and execution","author":"Bacchus","year":"1998"},{"key":"10.1016\/S0004-3702(99)00071-5_ID010","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"791","article-title":"Synthesizing plant controllers using real-time goals","author":"Barbeau","year":"1995"},{"key":"10.1016\/S0004-3702(99)00071-5_ID011","series-title":"UCPOP user's manual (version 2.0)","author":"Barrett","year":"1993"},{"key":"10.1016\/S0004-3702(99)00071-5_ID012","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1117","article-title":"Task-decomposition via plan parsing","author":"Barrett","year":"1994"},{"issue":"1","key":"10.1016\/S0004-3702(99)00071-5_ID013","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(94)90012-4","article-title":"Partial-order planning: Evaluating possible efficiency gains","volume":"67","author":"Barrett","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID014","series-title":"Integrated plan generation and recognition\u2014A logic-based approach","author":"Bauer","year":"1991"},{"key":"10.1016\/S0004-3702(99)00071-5_ID015","series-title":"Proc. European Conference on Artificial Intelligence (ECAI-96)","first-page":"599","article-title":"Modeling planning domains systematically","author":"Biundo","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID016","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"1240","article-title":"System assistance in structured domain model development","author":"Biundo","year":"1997"},{"key":"10.1016\/S0004-3702(99)00071-5_ID017","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","article-title":"Fast planning through planning graph analysis","volume":"90","author":"Blum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID018","series-title":"Proc. AAAI-97, Providence, RI","first-page":"714","article-title":"A robust and fast action selection mechanism for planning","author":"Bonet","year":"1997"},{"key":"10.1016\/S0004-3702(99)00071-5_ID019","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1016","article-title":"Using abstractions for decision-theoretic planning with time constraints","author":"Boutilier","year":"1994"},{"key":"10.1016\/S0004-3702(99)00071-5_ID020","series-title":"Prodigy 4.0: The manual and turorial","author":"Carbonell","year":"1992"},{"key":"10.1016\/S0004-3702(99)00071-5_ID021","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(91)90024-E","article-title":"O-plan: The open planning architecture","volume":"52","author":"Currie","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID022","series-title":"Proc. AAAI-93, Washington, DC","first-page":"574","article-title":"Planning with deadlines in stochastic domains","author":"Dean","year":"1993"},{"key":"10.1016\/S0004-3702(99)00071-5_ID023","series-title":"Handbook of Theoretical Computer Science, Vol. B","first-page":"997","article-title":"Temporal and modal logic","author":"Emerson","year":"1990"},{"key":"10.1016\/S0004-3702(99)00071-5_ID024","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"381","article-title":"On the complexity of domain-independent planning","author":"Erol","year":"1992"},{"key":"10.1016\/S0004-3702(99)00071-5_ID025","series-title":"Hierarchical task network planning: Formalization, analysis, and implementation, Ph.D. Thesis","author":"Erol","year":"1995"},{"issue":"2","key":"10.1016\/S0004-3702(99)00071-5_ID026","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(93)90080-U","article-title":"Acquiring search-control knowledge via static analysis","volume":"62","author":"Etzioni","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID027","series-title":"Handbook of Philosophical Logic, Vol. II","first-page":"249","article-title":"Quantification in modal logic","author":"Garson","year":"1977"},{"key":"10.1016\/S0004-3702(99)00071-5_ID028","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1613\/jair.316","article-title":"Accelerating partial-order planners: Some techniques for effective search control and pruning","volume":"5","author":"Gerevini","year":"1996","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(99)00071-5_ID029","series-title":"Proc. IJCAI-69, Washington, DC","first-page":"219","article-title":"Application of theorem proving to problem solving","author":"Green","year":"1969"},{"key":"10.1016\/S0004-3702(99)00071-5_ID030","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(92)90028-V","article-title":"On the complexity of blocks-world planning","volume":"56","author":"Gupta","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID031","series-title":"Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA","first-page":"325","article-title":"Model checking vs. theorem proving: A manifesto","author":"Halpern","year":"1991"},{"key":"10.1016\/S0004-3702(99)00071-5_ID032","series-title":"The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics","author":"Hennessy","year":"1990"},{"key":"10.1016\/S0004-3702(99)00071-5_ID033","series-title":"Handbook of Theoretical Computer Science, Vol. A","first-page":"69","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(99)00071-5_ID034","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1004","article-title":"Least-cost flaw repair: A plan refinement strategy for partial-order planning","author":"Joslin","year":"1994"},{"key":"10.1016\/S0004-3702(99)00071-5_ID035","series-title":"Handbook of Theoretical Computer Science, Vol. B","first-page":"1071","article-title":"Elements of relational database theory","author":"Kanellakis","year":"1990"},{"key":"10.1016\/S0004-3702(99)00071-5_ID036","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1194","article-title":"Pushing the envelope: Planning, propositional logic, and stochastic search","author":"Kautz","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID037","series-title":"Blackbox: A new approach to the application of theorem proving to problem solving","author":"Kautz","year":"1998"},{"key":"10.1016\/S0004-3702(99)00071-5_ID038","series-title":"Proc. International Conference on Artificial Intelligence Planning","first-page":"181","article-title":"The role of domain-specific knowledge in the planning as satisfiability framework","author":"Kautz","year":"1998"},{"key":"10.1016\/S0004-3702(99)00071-5_ID039","series-title":"Proc. IJCAI-81, Vancouver, BC","first-page":"345","article-title":"Don't be stupid","author":"Kibler","year":"1981"},{"issue":"2","key":"10.1016\/S0004-3702(99)00071-5_ID040","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","article-title":"Automatically generating abstractions for planning","volume":"68","author":"Knoblock","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID041","series-title":"European Conference on Planning","first-page":"273","article-title":"Extending planning graphs to an ADL subset","author":"Koehler","year":"1997"},{"issue":"1","key":"10.1016\/S0004-3702(99)00071-5_ID042","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90050-6","article-title":"SOAR: An architecture for general intelligence","volume":"33","author":"Laird","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID043","series-title":"The Temporal Logic of Reactive and Concurrent Systems: Specication","author":"Manna","year":"1992"},{"key":"10.1016\/S0004-3702(99)00071-5_ID044","series-title":"Proc. Third International Conference on AI Planning Systems","article-title":"A heuristic estimator for means-end analysis in planning","author":"McDermott","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID045","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1613\/jair.64","article-title":"Total-order and partial-order planning: A comparative analysis","volume":"2","author":"Minton","year":"1994","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(99)00071-5_ID046","series-title":"Learning Search Control Knowledge","author":"Minton","year":"1988"},{"key":"10.1016\/S0004-3702(99)00071-5_ID047","series-title":"A study of procedural search control in simon","author":"Parekh","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID048","series-title":"Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ont.","first-page":"324","article-title":"ADL: Exploring the middle ground between STRIPS and the situation calculus","author":"Pednault","year":"1989"},{"key":"10.1016\/S0004-3702(99)00071-5_ID049","series-title":"Proc. AAAI-93, Washington, DC","first-page":"492","article-title":"Threat-removal strategies for partial-order planning","author":"Poet","year":"1993"},{"key":"10.1016\/S0004-3702(99)00071-5_ID050","series-title":"Proc. IJCAI-81, Vancouver, BC","first-page":"115","article-title":"Plan synthesis: A logical perspective","author":"Rosenschein","year":"1981"},{"key":"10.1016\/S0004-3702(99)00071-5_ID051","series-title":"Artificial Intelligence A Modern Approach","author":"Russell","year":"1995"},{"key":"10.1016\/S0004-3702(99)00071-5_ID052","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","article-title":"Planning in a hierarchy of abstraction spaces","volume":"5","author":"Sacerdoti","year":"1974","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID053","series-title":"Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany","first-page":"521","article-title":"Near-optimal plans, tractability and reactivity","author":"Selman","year":"1994"},{"key":"10.1016\/S0004-3702(99)00071-5_ID054","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF01211865","article-title":"Safety, liveness, and fairness in temporal logic","volume":"6","author":"Sistla","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S0004-3702(99)00071-5_ID055","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logic","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(99)00071-5_ID056","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.428","article-title":"Synthesizing customized planners from specifications","volume":"8","author":"Srivastava","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(99)00071-5_ID057","series-title":"Proc. International Conference on Artificial Intelligence Planning","first-page":"213","article-title":"Deduction-based refinement planning","author":"Stephan","year":"1996"},{"key":"10.1016\/S0004-3702(99)00071-5_ID058","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1079","article-title":"Control strategies for a stochastic planner","author":"Tash","year":"1994"},{"key":"10.1016\/S0004-3702(99)00071-5_ID059","series-title":"Proc. IJCAI-77, Cambridge, MA","first-page":"888","article-title":"Generating project networks","author":"Tate","year":"1977"},{"key":"10.1016\/S0004-3702(99)00071-5_ID060","series-title":"Carpoolworld","author":"Thompson","year":"1998"},{"key":"10.1016\/S0004-3702(99)00071-5_ID061","series-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing","first-page":"176","article-title":"The complexity of relational query langauges","author":"Vardi","year":"1982"},{"issue":"4","key":"10.1016\/S0004-3702(99)00071-5_ID062","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1093\/jigpal\/6.4.601","article-title":"Computational model theory: An overview","volume":"6","author":"Vardi","year":"1998","journal-title":"Logic J. IGPL"},{"issue":"1","key":"10.1016\/S0004-3702(99)00071-5_ID063","doi-asserted-by":"crossref","DOI":"10.1080\/09528139508953801","article-title":"Integrating planning and learning: The PRODIGY architecture","volume":"7","author":"Veloso","year":"1995","journal-title":"J. Experimental and Theoretical Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00071-5_ID064","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1042","article-title":"The first law of robotics (a call to arms)","author":"Weld","year":"1994"},{"issue":"4","key":"10.1016\/S0004-3702(99)00071-5_ID065","first-page":"27","article-title":"An introduction to least commitment planning","volume":"15","author":"Weld","year":"1994","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00071-5_ID066","series-title":"Practical Planning: Extending the Classical AI Planning Paradigm","author":"Wilkins","year":"1988"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000715?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000715?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T11:22:23Z","timestamp":1578828143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370299000715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0004370299000715"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(99)00071-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}