{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:49:49Z","timestamp":1773938989892,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4312,"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":[[2001,11]]},"DOI":"10.1016\/s0004-3702(01)00128-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T09:01:41Z","timestamp":1034586101000},"page":"151-182","source":"Crossref","is-referenced-by-count":59,"title":["Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP"],"prefix":"10.1016","volume":"132","author":[{"given":"Minh Binh","family":"Do","sequence":"first","affiliation":[]},{"given":"Subbarao","family":"Kambhampati","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00128-X_BIB001","series-title":"Proc. AAAI-96, Portland, OR","article-title":"A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem","author":"Bayardo","year":"1996"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00128-X_BIB002","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(01)00128-X_BIB003","series-title":"Proc. CP'98 Workshop on Constraint Problem Reformulation","article-title":"Mixed integer programming models for planning problems","author":"Bockmayr","year":"1998"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB004","series-title":"Proc. 5th European Conference on Planning","article-title":"Planning as heuristic search: New results","author":"Bonet","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB005","series-title":"Proc. AAAI-97, Providence, RI","article-title":"A robust and fast action selection mechanism for planning","author":"Bonet","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB006","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\/S0004-3702(01)00128-X_BIB007","series-title":"Proc. AIPS-2000","article-title":"Investigating the effect of relevance and reachability constraints on SAT encodings of planning","author":"Do","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB008","series-title":"Proc. AIPS-2000","article-title":"Solving planning-graph by compiling it into CSP","author":"Do","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB009","series-title":"Proc. IJCAI-97, Nagoya, Japan","article-title":"Automatic SAT compilation of planning problems","author":"Ernst","year":"1997"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB010","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"The detection and exploitation of symmety in planning domains","author":"Fox","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB011","series-title":"Symposium on Abstraction Reformulation and Approximation","article-title":"On reformulating planning as dynamic constraint satisfaction (extended abstract)","author":"Frank","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB012","series-title":"Proc. AAAI-94, Seattle, WA","article-title":"Dead-end driven learning","author":"Frost","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB013","series-title":"Proc. KR-2000","article-title":"Satisfiability algorithms and finite quantification","author":"Ginsberg","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB014","series-title":"A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm","author":"Hoffman","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB015","series-title":"Proc. IJCAI-97, Nagoya, Japan","article-title":"Challenges in bridging plan synthesis paradigms","author":"Kambhampati","year":"1997"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB016","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Improving Graphplan's search with ebl & ddb techniques","author":"Kambhampati","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB017","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0004-3702(98)00087-3","article-title":"On the relation between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning","volume":"105","author":"Kambhampati","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","article-title":"Planning Graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan","volume":"12","author":"Kambhampati","year":"2000","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00128-X_BIB019","series-title":"Proc. 4th European Conference on Planning","article-title":"Understanding and extending graphplan","author":"Kambhampati","year":"1997"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB020","series-title":"Proc. AIPS-00","article-title":"Distance-based goal-ordering techniques for graphplan","author":"Kambhampati","year":"2000"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB021","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Blackbox: Unifying SAT-based and graph-based planning","author":"Kautz","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB022","series-title":"Proc. AAAI-96, Portland, OR","article-title":"Pushing the envelope: Planning, propositional logic and stochastic search","author":"Kautz","year":"1996"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB023","series-title":"Proc. AAAI-99, Orlando, FL","article-title":"State-space planning by integer optimization","author":"Kautz","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB024","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1613\/jair.570","article-title":"Efficient implementation of the plan graph in STAN","volume":"10","author":"Long","year":"1999","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00128-X_BIB025","series-title":"Proc. AAAI-99, Orlando, FL","article-title":"On the utility of plan-space (causal) encodings","author":"Mali","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB026","series-title":"AIPS-98 planning competition results","author":"McDermott","year":"1998"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB027","series-title":"Proc. AAAI-90, Boston, MA","article-title":"Dynamic constraint satisfaction problems","author":"Mittal","year":"1990"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB028","series-title":"Proc. Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy","article-title":"A planning algorithm non-based on directional search","author":"Rintanen","year":"1998"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB029","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Temporal planning with mutual exclusion reasoning","author":"Smith","year":"1999"},{"issue":"1","key":"10.1016\/S0004-3702(01)00128-X_BIB030","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1017\/S0269888900001089","article-title":"Bridging the gap between planning and scheduling","volume":"15","author":"Smith","year":"2000","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB031","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0004-3702(01)00122-9","article-title":"Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan","volume":"131","author":"Srivastava","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB032","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB033","series-title":"CSPLIB: A library of CSP routines","author":"van Beek","year":"1994"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB034","series-title":"Proc. AAAI-99, Orlando, FL","article-title":"CPlan: A constraint programming approach to planning","author":"van Beek","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB035","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"On the use of integer programming models in AI planning","author":"Vossen","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB036","series-title":"Proc. AAAI-98, Madison, WI","article-title":"Extending graphplan to handle uncertainty & sensing actions","author":"Weld","year":"1998"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB037","series-title":"General Paper","article-title":"Automatic discovery and exploitation of domain knowledge in planning","author":"Wolfman","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB038","series-title":"Proc. AAAI-99, Orlando, FL","article-title":"Exploiting symmetry in the plan-graph via explanation-guided search","author":"Zimmerman","year":"1999"},{"key":"10.1016\/S0004-3702(01)00128-X_BIB039","series-title":"Intelligent Scheduling","author":"Zweben","year":"1994"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020100128X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020100128X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T02:30:33Z","timestamp":1579141833000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437020100128X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S000437020100128X"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00128-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}