SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

Artificial Intelligence

Volumn 147, Issue 1-2, 2003, Pages 85-117

  Castellini, Claudio ^a   Giunchiglia, Enrico ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Concurrency; Planning under uncertainty; SAT based planning; Satisfiability

Indexed keywords

CONCURRENCY CONTROL; CONSTRAINT THEORY; LARGE SCALE SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PLANNING;

NONDETERMINISM;

ARTIFICIAL INTELLIGENCE;

EID: 0037503164     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00375-2     Document Type: Article

References (53)

1. Achlioptas D., Gomes C., Kautz H., Selman B. Generating satisfiable problem instances. Proc. AAAI-2000, Austin, TX. 2000;256-261.
2. Bayardo R.J. Jr., Schrag R.C. Using CSP look-back techniques to solve real-world SAT instances. Proc. AAAI-97/IAAI-97, Providence, RI. 1997;203-208 AAAI Press, Menlo Park, CA.
3. Bertoli P., Cimatti A., Roveri M. Heuristic search + symbolic model checking = efficient conformant planning. Proc. IJCAI-2001, Seattle, WA. 2001;467-472.
4. Biere A., Cimatti A., Clarke E., Zhu Y. Symbolic model checking without BDDs. Proc. Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-99), Amsterdam. 1999;193-207.
5. Blum A., Furst M. Fast planning through planning graph analysis. Proc. IJCAI-95, Montreal, Quebec. 1995;1636-1642.
6. Bonet B., Geffner H. Planning with incomplete information as heuristic search in belief space. Proc. AIPS-2000, Breckenridge, CO. 2000;52-61.
7. Bryant R.E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surveys. 24:(3):1992;293-318.
8. Cadoli M., Giovanardi A., Schaerf M. An algorithm to evaluate quantified boolean formulae. Proc. AAAI-98, Madison, WI. 1998;262-267.
9. Cimatti A., Roveri M. Conformant planning via model checking. Proc. 5th European Conference on Planning (ECP-99), Durham, UK. Lecture Notes in Computer Science. 1809:1999;21-34 Springer, Berlin.
10. Cimatti A., Roveri M. Conformant planning via symbolic model checking. J. Artificial Intelligence Res. 13:2000;305-338.
11. Copty F., Fix L., Giunchiglia E., Kamhi G., Tacchella A., Vardi M. Benefits of bounded model checking at an industrial setting. Proc. 13th International Computer Aided Verification Conference (CAV 2001), Paris. Lecture Notes in Computer Science. 2102:2001;436-453 Springer, Berlin.
12. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:(7):1962;394-397.
13. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence. 41:(3):1990;273-312.
14. Ernst M., Millstein T., Weld D. Automatic SAT-compilation of planning problems. Proc. IJCAI-97, Nagoya, Japan. 1997;1169-1177.
15. Ferraris P., Giunchiglia E. Planning as satisfiability in nondeterministic domains. Proc. AAAI-2000, Austin, TX. 2000;748-753.
16. Finzi A., Pirri F., Reiter R. Open world planning in the situation calculus. Proc. AAAI-2000, Austin, TX. 2000;754-760.
17. Giunchiglia E., Lifschitz V. Dependent fluents. Proc. IJCAI-95, Montreal, Quebec. 1995;1964-1969.
18. Giunchiglia E., Lifschitz V. An action language based on causal explanation: Preliminary report. Proc. AAAI-98, Madison, WI. 1998;623-630.
19. Giunchiglia E., Tacchella A. *SAT: A system for the development of modal decision procedures. Proc. 17th International Conference on Automated Deduction (CADE-2000), Pittsburgh, PA. 2000;291-296.
20. Giunchiglia E., Neelakantan Kartha G., Lifschitz V. Representing action: Indeterminacy and ramifications. Artificial Intelligence. 95:1997;409-443.
21. Giunchiglia E., Giunchiglia F., Tacchella A. SAT-based decision procedures for classical modal logics. J. Automat. Reason. 28:2002;143-171. Reprinted in: Gent I., Maaren H. Van, Walsh T. SAT2000. Highlights of Satisfiability Research in the Year 2000. 2000;IOS Press, Amsterdam.
22. Giunchiglia E., Giunchiglia F., Tacchella A. SAT-based decision procedures for classical modal logics. J. Automat. Reason. 28:2002;143-171. Reprinted in: Gent I., Maaren H. Van, Walsh T. SAT2000. Highlights of Satisfiability Research in the Year 2000. 2000;IOS Press, Amsterdam.
23. Giunchiglia E., Maratea M., Tacchella A., Zambonin D. Evaluating search heuristics and optimization techniques in propositional satisfiability. Proc. International Joint Conference on Automated Reasoning (IJCAR-2001), Siena, Italy. Lecture Notes in Artificial Intelligence. 2083:2001;347-363 Springer, Berlin.
24. Green C. Application of theorem proving to problem solving. Proc. IJCAI-69, Washington, DC. 1969;219-240.
25. Haslum P., Geffner H. Admissible heuristics for optimal planning. Proc. AIPS-2000, Breckenridge, CO. 2000;140-149.
26. Kambhampati S. Planning graph as (dynamic) CSP: Exploiting CBL, DDB and other CSP search techniques in Graphplan. J. Artificial Intelligence Res. 12:2000;1-34.
27. Kautz H., Selman B. Planning as satisfiability. Proc. ECAI-92, Vienna, Austria. 1992;359-363.
28. Kautz H., Selman B. Pushing the envelope: Planning, propositional logic and stochastic search. Proc. AAAI-96, Portland, OR. 1996;1194-1201.
29. Kautz H., Selman B. BLACKBOX: A new approach to the application of theorem proving to problem solving. Working Notes of the Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98, Pittsburgh, PA. 1998.
30. Kautz H., McAllester D., Selman B. Encoding plans in propositional logic. Proc. KR-96, Cambridge, MA. 1996;374-384.
31. Kurien J.A., Nayak P.P., Smith D.E. Fragment-based conformant planning. Proc. 6th Internat. Conference Artificial Intelligence Planning and Scheduling (AIPS-2002). 2002.
32. Li C.M., Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proc. IJCAI-97, Nagoya, Japan. 1997;366-371 Morgan Kaufmann, San Francisco, CA.
33. Lifschitz V. Frames in the space of situations. Artificial Intelligence. 46:1990;365-376.
34. Lifschitz V. On the logic of causal explanation. Artificial Intelligence. 96:1997;451-465.
35. Lin F., Reiter R. State constraints revisited. J. Logic Comput. 4:1994;655-678.
36. Long D., Fox M. The efficient implementation of the plan-graph. J. Artificial Intelligence Res. 10:1999;85-115.
37. McCain N., Turner H. Causal theories of action and change. Proc. AAAI-97, Providence, RI. 1997;460-465.
38. McCain N., Turner H. Satisfiability planning with causal theories. Proc. Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;212-223.
39. McDermott D. A critique of pure reason. Computational Intelligence. 3:1987;151-160.
40. Moore D.S., McCabe G.P. Introduction to the Practice of Statistics. 1993;Freeman, New York.
41. Myers K., Smith D. The persistence of derived information. Proc. AAAI-88, St. Paul, MN. 1988;496-500.
42. Nilsson N. Principles of Artificial Intelligence. 1980;Morgan Kaufmann, Los Altos, CA.
43. Plaisted D.A., Greenbaum S. A structure-preserving clause form translation. J. Symbolic Comput. 2:1986;293-304.
44. Prosser P. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence. 9:(3):1993;268-299.
45. Rintanen J. Constructing conditional plans by a theorem prover. J. Artificial Intelligence Res. 10:1999;323-352.
46. Rintanen J. Improvements to the evaluation of quantified boolean formulae. Thomas D. Proc. IJCAI-99, Stockholm, Sweden, Vol. 2. 1999;1192-1197 Morgan Kaufmann, San Mateo, CA.
47. Rintanen J. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. Proc. LPAR. Lecture Notes in Computer Science. 2250:2001;362-376 Springer, Berlin.
48. Selman B., Levesque H., Mitchell D. A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA. 1992;440-446.
49. Shtrichman O. Tuning SAT checkers for bounded model-checking. Proc. 12th International Computer Aided Verification Conference (CAV-2000), Chicago, IL. Lecture Notes in Computer Science. 1855:2000;480-494 Springer, Berlin.
50. Smith D., Weld D. Conformant Graphplan. Proc. AAAI-98, Madison, WI. 1998;889-896.
51. Tseitin G. On the complexity of proofs in propositional logics. Seminars in Mathematics. 8:1970;. Reprinted in: Siekmann J., Wrightson G. Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, Vol. 2. 1983;Springer, Berlin.
52. Tseitin G. On the complexity of proofs in propositional logics. Seminars in Mathematics. 8:1970;. Reprinted in: Siekmann J., Wrightson G. Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, Vol. 2. 1983;Springer, Berlin.
53. Zhang H. SATO: An efficient propositional prover. McCune W. Proc. CADE-14, Townsville, Australia. Lecture Notes in Artificial Intelligence. 1249:1997;272-275 Springer, Berlin.