{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T09:51:04Z","timestamp":1726221064837},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"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":2703,"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":[[2006,3]]},"DOI":"10.1016\/j.artint.2005.08.004","type":"journal-article","created":{"date-parts":[[2005,9,30]],"date-time":"2005-09-30T11:17:14Z","timestamp":1128079034000},"page":"298-335","source":"Crossref","is-referenced-by-count":60,"title":["Branching and pruning: An optimal temporal POCL planner based on constraint programming"],"prefix":"10.1016","volume":"170","author":[{"given":"Vincent","family":"Vidal","sequence":"first","affiliation":[]},{"given":"H\u00e9ctor","family":"Geffner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.artint.2005.08.004_bib001","first-page":"47","article-title":"The 2000 AI planning systems competition","volume":"22","author":"Bacchus","year":"2001","journal-title":"Artificial Intelligence Magazine"},{"key":"10.1016\/j.artint.2005.08.004_bib002","series-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"Baptiste","year":"2001"},{"key":"10.1016\/j.artint.2005.08.004_bib003","series-title":"Proceedings of IJCAI-95, Montreal, Quebec","first-page":"1636","article-title":"Fast planning through planning graph analysis","author":"Blum","year":"1995"},{"issue":"1\u20132","key":"10.1016\/j.artint.2005.08.004_bib004","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","article-title":"Planning as heuristic search","volume":"129","author":"Bonet","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2005.08.004_bib005","series-title":"Proceedings of AAAI-97, Providence, RI","first-page":"714","article-title":"A robust and fast action selection mechanism for planning","author":"Bonet","year":"1997"},{"issue":"2","key":"10.1016\/j.artint.2005.08.004_bib006","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job shop scheduling problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/j.artint.2005.08.004_bib007","unstructured":"Y. Caseau, F.X. Josset, F. Laburthe, CLAIRE: Combining sets, search and rules to better express algorithms, in: Proceedings of ICLP-99, 1999, pp. 245\u2013259"},{"key":"10.1016\/j.artint.2005.08.004_bib008","series-title":"Proceedings of ICLP-94","first-page":"369","article-title":"Improved CLP scheduling with task intervals","author":"Caseau","year":"1994"},{"key":"10.1016\/j.artint.2005.08.004_bib009","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"},{"key":"10.1016\/j.artint.2005.08.004_bib010","unstructured":"M.B. Do, S. Kambhampati, Solving planning-graph by compiling it into CSP, in: Proceedings of AIPS-00, 2000, pp. 82\u201391"},{"key":"10.1016\/j.artint.2005.08.004_bib011","author":"Edelkamp"},{"key":"10.1016\/j.artint.2005.08.004_bib012","series-title":"Proceedings of ICLP-99","first-page":"515","article-title":"Solving TSPs with time windows with constraints","author":"Focacci","year":"1999"},{"key":"10.1016\/j.artint.2005.08.004_bib013","unstructured":"F. Focacci, M. Milano, Connections and integrations of dynamic programming and constraint programming, in: Proceedings of CP-AI-OR'01, 2001"},{"key":"10.1016\/j.artint.2005.08.004_bib014","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","article-title":"PDDL2.1: An extension to PDDL for expressing temporal planning domains","author":"Fox","year":"2003","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.artint.2005.08.004_bib015","author":"Geffner"},{"key":"10.1016\/j.artint.2005.08.004_bib016","unstructured":"P. Haslum, H. Geffner, Admissible heuristics for optimal planning, in: Proceedings of the Fifth International Conference on AI Planning Systems (AIPS-2000), 2000, pp. 70\u201382"},{"key":"10.1016\/j.artint.2005.08.004_bib017","unstructured":"P. Haslum, H. Geffner, Heuristic planning with time and resources, in: Proceedings of European Conference of Planning (ECP-01), 2001, pp. 121\u2013132"},{"key":"10.1016\/j.artint.2005.08.004_bib018","unstructured":"A. Jonsson, P. Morris, N. Muscettola, K. Rajan, Planning in interplanetary space: Theory and practice, in: Proceedings of AIPS-2000, 2000, pp. 177\u2013186"},{"key":"10.1016\/j.artint.2005.08.004_bib019","unstructured":"D. Joslin, M.E. Pollack, Is \u201cearly commitment\u201d in plan generation ever a good idea?, in: Proceedings of AAAI-96, Portland, OR, 1996, pp. 1188\u20131193"},{"issue":"1\u20132","key":"10.1016\/j.artint.2005.08.004_bib020","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)00076-D","article-title":"Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning","volume":"76","author":"Kambhampati","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2005.08.004_bib021","series-title":"New Directions in AI Planning","first-page":"61","article-title":"Universal classical planner: An algorithm for unifying state-space and plan-space planning","author":"Kambhampati","year":"1996"},{"key":"10.1016\/j.artint.2005.08.004_bib022","unstructured":"H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Proceedings of KR-96, 1996, pp. 374\u2013384"},{"key":"10.1016\/j.artint.2005.08.004_bib023","series-title":"Proceedings of IJCAI-99, Stockholm, Sweden","first-page":"318","article-title":"Unifying SAT-based and Graph-based planning","author":"Kautz","year":"1999"},{"key":"10.1016\/j.artint.2005.08.004_bib024","series-title":"Recent Advances in AI Planning. Proceedings of 4th European Conf. on Planning (ECP-97)","first-page":"273","article-title":"Extending planning graphs to an ADL subset","volume":"vol. 1348","author":"Koehler","year":"1997"},{"key":"10.1016\/j.artint.2005.08.004_bib025","unstructured":"J. Koehler, K. Schuster, Elevator control as a planning problem, in: Proceedings of AIPS-00, 2000, pp. 331\u2013338"},{"key":"10.1016\/j.artint.2005.08.004_bib026","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","article-title":"Algorithms for propagating resource constraints in AI planning and scheduling","volume":"143","author":"Laborie","year":"2003","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2005.08.004_bib027","series-title":"Proceedings of IJCAI-95, Montreal, Quebec","first-page":"1643","article-title":"Planning with sharable resources constraints","author":"Laborie","year":"1995"},{"key":"10.1016\/j.artint.2005.08.004_bib028","series-title":"Proceedings of CP-00","article-title":"CHOCO: implementing a CP kernel","volume":"vol. 1894","author":"Laburthe","year":"2000"},{"key":"10.1016\/j.artint.2005.08.004_bib029","series-title":"Proceedings of IJCAI-93, Chamb\u00e9ry, France","first-page":"232","article-title":"Consistency techniques for numeric CSPs","author":"Lhomme","year":"1993"},{"key":"10.1016\/j.artint.2005.08.004_bib030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1026044009832","article-title":"The 3rd international planning competition: Results and analysis","volume":"20","author":"Long","year":"2003","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.artint.2005.08.004_bib031","unstructured":"A. Mali, A. Kambhampati, On the utility of plan-space (causal) encodings, in: Proceedings of AAAI-99, Orlando, FL, 1999, pp. 557\u2013563"},{"key":"10.1016\/j.artint.2005.08.004_bib032","series-title":"Proceedings of AAAI-91, Anaheim, CA","first-page":"634","article-title":"Systematic nonlinear planning","author":"McAllester","year":"1991"},{"key":"10.1016\/j.artint.2005.08.004_bib033","unstructured":"D. McDermott, A heuristic estimator for means-ends analysis in planning, in: Proceedings of AIPS-96, 1996, pp. 142\u2013149"},{"key":"10.1016\/j.artint.2005.08.004_bib034","doi-asserted-by":"crossref","unstructured":"M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of DAC-01, 2001, pp. 530\u2013535","DOI":"10.1145\/378239.379017"},{"key":"10.1016\/j.artint.2005.08.004_bib035","unstructured":"X.L. Nguyen, S. Kambhampati, Reviving partial order planning, in: Proceedings of IJCAI-01, Seattle, WA, 2001, pp. 459\u2013466"},{"key":"10.1016\/j.artint.2005.08.004_bib036","unstructured":"H. Palacios, H. Geffner, Planning as branch and bound: A constraint programming implementation, in: Proceedings of XXVIII Conf. Latinoamericana de Inform\u00e1tica, 2002, pp. 239\u2013251"},{"key":"10.1016\/j.artint.2005.08.004_bib037","unstructured":"J.S. Penberthy, D.S. Weld, Temporal planning with continuous change, in: Proceedings of AAAI-94, Seattle, WA, 1994, pp. 1010\u20131015"},{"key":"10.1016\/j.artint.2005.08.004_bib038","unstructured":"J. Porteous, L. Sebastia, J. Hoffmann, On the extraction, ordering, and usage of landmarks in planning, in: Proceedings of ECP-01, 2001, pp. 37\u201348"},{"issue":"1","key":"10.1016\/j.artint.2005.08.004_bib039","first-page":"61","article-title":"Bridging the gap between planning and scheduling","volume":"15","author":"Smith","year":"2000","journal-title":"Knowledge Engrg. Rev."},{"key":"10.1016\/j.artint.2005.08.004_bib040","series-title":"Proceedings of IJCAI-99, Stockholm, Sweden","first-page":"326","article-title":"Temporal planning with mutual exclusion reasoning","author":"Smith","year":"1999"},{"key":"10.1016\/j.artint.2005.08.004_bib041","unstructured":"S. Smith, C. Cheng, Slack-based heuristics for the constraint satisfaction scheduling, in: Proceedings of AAAI-93, Washington, DC, 1993, pp. 139\u2013144"},{"key":"10.1016\/j.artint.2005.08.004_bib042","unstructured":"P. Van Beek, X. Chen, CPlan: a constraint programming approach to planning, in: Proceedings AAAI-99, Orlando, FL, 1999, pp. 585\u2013590"},{"key":"10.1016\/j.artint.2005.08.004_bib043","series-title":"The OPL Optimization Programming Language","author":"Van Hentenryck","year":"1999"},{"issue":"1\u20133","key":"10.1016\/j.artint.2005.08.004_bib044","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","article-title":"Constraint satisfaction using constraint logic programming","volume":"58","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.artint.2005.08.004_bib045","unstructured":"V. Vidal, H. Geffner, Branching and pruning: An optimal temporal POCL planner based on constraint programming, in: Proceedings of AAAI-2004, San Jose, CA, 2004, pp. 570\u2013577"},{"issue":"4","key":"10.1016\/j.artint.2005.08.004_bib046","first-page":"27","article-title":"An introduction to least commitment planning","volume":"15","author":"Weld","year":"1994","journal-title":"AI Magazine"},{"key":"10.1016\/j.artint.2005.08.004_bib047","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1613\/jair.1136","article-title":"VHPOP: Versatile heuristic partial order planner","volume":"20","author":"Younes","year":"2003","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.artint.2005.08.004_bib048","doi-asserted-by":"crossref","unstructured":"Y. Zhang, R. Yap, Arc consistency on n-ary monotonic and linear constraints, in: Proceedings of CP 2000, 2000, pp. 470\u2013483","DOI":"10.1007\/3-540-45349-0_34"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370205001281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370205001281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T00:15:17Z","timestamp":1586477717000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370205001281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["S0004370205001281"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2005.08.004","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}