{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:10:18Z","timestamp":1772021418865,"version":"3.50.1"},"reference-count":51,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3705,"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":[[2003,7]]},"DOI":"10.1016\/s0004-3702(02)00375-2","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T14:29:44Z","timestamp":1043936984000},"page":"85-117","source":"Crossref","is-referenced-by-count":41,"title":["SAT-based planning in complex domains: Concurrency, constraints and nondeterminism"],"prefix":"10.1016","volume":"147","author":[{"given":"Claudio","family":"Castellini","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[]},{"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00375-2_BIB001","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"256","article-title":"Generating satisfiable problem instances","author":"Achlioptas","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB002","series-title":"Proc. AAAI-97\/IAAI-97, Providence, RI","first-page":"203","article-title":"Using CSP look-back techniques to solve real-world SAT instances","author":"Bayardo","year":"1997"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB003","series-title":"Proc. IJCAI-2001, Seattle, WA","first-page":"467","article-title":"Heuristic search + symbolic model checking = efficient conformant planning","author":"Bertoli","year":"2001"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB004","series-title":"Proc. Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-99), Amsterdam","first-page":"193","article-title":"Symbolic model checking without BDDs","author":"Biere","year":"1999"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB005","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"1636","article-title":"Fast planning through planning graph analysis","author":"Blum","year":"1995"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB006","series-title":"Proc. AIPS-2000, Breckenridge, CO","first-page":"52","article-title":"Planning with incomplete information as heuristic search in belief space","author":"Bonet","year":"2000"},{"issue":"3","key":"10.1016\/S0004-3702(02)00375-2_BIB007","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic Boolean manipulation with ordered binary-decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB008","series-title":"Proc. AAAI-98, Madison, WI","first-page":"262","article-title":"An algorithm to evaluate quantified boolean formulae","author":"Cadoli","year":"1998"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB009","series-title":"Proc. 5th European Conference on Planning (ECP-99), Durham, UK","first-page":"21","article-title":"Conformant planning via model checking","volume":"1809","author":"Cimatti","year":"1999"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB010","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.774","article-title":"Conformant planning via symbolic model checking","volume":"13","author":"Cimatti","year":"2000","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00375-2_BIB011","series-title":"Proc. 13th International Computer Aided Verification Conference (CAV 2001), Paris","first-page":"436","article-title":"Benefits of bounded model checking at an industrial setting","volume":"2102","author":"Copty","year":"2001"},{"issue":"7","key":"10.1016\/S0004-3702(02)00375-2_BIB012","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0004-3702(02)00375-2_BIB013","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB014","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"1169","article-title":"Automatic SAT-compilation of planning problems","author":"Ernst","year":"1997"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB015","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"748","article-title":"Planning as satisfiability in nondeterministic domains","author":"Ferraris","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB016","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"754","article-title":"Open world planning in the situation calculus","author":"Finzi","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB017","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"1964","article-title":"Dependent fluents","author":"Giunchiglia","year":"1995"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB018","series-title":"Proc. AAAI-98, Madison, WI","first-page":"623","article-title":"An action language based on causal explanation: Preliminary report","author":"Giunchiglia","year":"1998"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB019","series-title":"Proc. 17th International Conference on Automated Deduction (CADE-2000), Pittsburgh, PA","first-page":"291","article-title":"\u2217sat: A system for the development of modal decision procedures","author":"Giunchiglia","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB020","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0004-3702(97)00037-4","article-title":"Representing action: Indeterminacy and ramifications","volume":"95","author":"Giunchiglia","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB021","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1015071400913","article-title":"SAT-based decision procedures for classical modal logics","volume":"28","author":"Giunchiglia","year":"2002","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(02)00375-2_BIB022","series-title":"Proc. International Joint Conference on Automated Reasoning (IJCAR-2001), Siena, Italy","first-page":"347","article-title":"Evaluating search heuristics and optimization techniques in propositional satisfiability","volume":"2083","author":"Giunchiglia","year":"2001"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB023","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(02)00375-2_BIB024","series-title":"Proc. AIPS-2000, Breckenridge, CO","first-page":"140","article-title":"Admissible heuristics for optimal planning","author":"Haslum","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","article-title":"Planning graph as (dynamic) CSP: Exploiting CBL, 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(02)00375-2_BIB026","series-title":"Proc. ECAI-92, Vienna, Austria","first-page":"359","article-title":"Planning as satisfiability","author":"Kautz","year":"1992"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB027","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(02)00375-2_BIB028","series-title":"Working Notes of the Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98, Pittsburgh, PA","article-title":"BLACKBOX: A new approach to the application of theorem proving to problem solving","author":"Kautz","year":"1998"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB029","series-title":"Proc. KR-96, Cambridge, MA","first-page":"374","article-title":"Encoding plans in propositional logic","author":"Kautz","year":"1996"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB030","series-title":"Proc. 6th Internat. Conference Artificial Intelligence Planning and Scheduling (AIPS-2002)","article-title":"Fragment-based conformant planning","author":"Kurien","year":"2002"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB031","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"366","article-title":"Heuristics based on unit propagation for satisfiability problems","author":"Li","year":"1997"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB032","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0004-3702(90)90021-Q","article-title":"Frames in the space of situations","volume":"46","author":"Lifschitz","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB033","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0004-3702(97)00057-X","article-title":"On the logic of causal explanation","volume":"96","author":"Lifschitz","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB034","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1093\/logcom\/4.5.655","article-title":"State constraints revisited","volume":"4","author":"Lin","year":"1994","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(02)00375-2_BIB035","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1613\/jair.570","article-title":"The efficient implementation of the plan-graph","volume":"10","author":"Long","year":"1999","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00375-2_BIB036","series-title":"Proc. AAAI-97, Providence, RI","first-page":"460","article-title":"Causal theories of action and change","author":"McCain","year":"1997"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB037","series-title":"Proc. Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy","first-page":"212","article-title":"Satisfiability planning with causal theories","author":"McCain","year":"1998"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB038","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1111\/j.1467-8640.1987.tb00183.x","article-title":"A critique of pure reason","volume":"3","author":"McDermott","year":"1987","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB039","series-title":"Introduction to the Practice of Statistics","author":"Moore","year":"1993"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB040","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"496","article-title":"The persistence of derived information","author":"Myers","year":"1988"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB041","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB042","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","article-title":"A structure-preserving clause form translation","volume":"2","author":"Plaisted","year":"1986","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"10.1016\/S0004-3702(02)00375-2_BIB043","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB044","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","article-title":"Constructing conditional plans by a theorem prover","volume":"10","author":"Rintanen","year":"1999","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00375-2_BIB045","series-title":"Proc. IJCAI-99, Stockholm, Sweden, Vol. 2","first-page":"1192","article-title":"Improvements to the evaluation of quantified boolean formulae","author":"Rintanen","year":"1999"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB046","series-title":"Proc. LPAR","first-page":"362","article-title":"Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae","volume":"2250","author":"Rintanen","year":"2001"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB047","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB048","series-title":"Proc. 12th International Computer Aided Verification Conference (CAV-2000), Chicago, IL","first-page":"480","article-title":"Tuning SAT checkers for bounded model-checking","volume":"1855","author":"Shtrichman","year":"2000"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB049","series-title":"Proc. AAAI-98, Madison, WI","first-page":"889","article-title":"Conformant Graphplan","author":"Smith","year":"1998"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB050","article-title":"On the complexity of proofs in propositional logics","volume":"8","author":"Tseitin","year":"1970","journal-title":"Seminars in Mathematics"},{"key":"10.1016\/S0004-3702(02)00375-2_BIB051","series-title":"Proc. CADE-14, Townsville, Australia","first-page":"272","article-title":"SATO: An efficient propositional prover","volume":"1249","author":"Zhang","year":"1997"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:54:14Z","timestamp":1553932454000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202003752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":51,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0004370202003752"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00375-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}