Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 308-314

  Do, Minh Binh ^a   Srivastava, Biplav ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; SIGNAL ENCODING;

BLACK BOXES; ENCODINGS; FORWARD PROPAGATION; GRAPHPLAN; ITS EFFICIENCIES; MUTEXES; MUTUAL EXCLUSIONS; REACHABILITY; REACHABILITY CONSTRAINTS; SATISFACTION PROBLEM;

ENCODING (SYMBOLS);

EID: 0010311743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bayardo, R., and Schrag, R. 1997. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In the Proceedings of AAAI97.
2. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In the Proceedings of IJCAI-95, 1636-1642.
3. Blum, A., and Langford, J. 1999. Probabilistic Planning in the Graphplan Framework. In Proc. 5th European Conference on Planning.
4. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In Proc. 5th European Conference on Planning.
5. Brafman, R. 1999. Reachability, Relevance, Resolution and the Planning as Satisfiability Approach. IJCAI-99.
6. Eugene, F., and Quiang, Y. 1992. Formalizing Plan Justifications. In Proceedings of CSCSI-92, 9-14.
7. Huang, Y.; Selman, B.; and Kautz, H. 1999. Control Knowledge in Planning: Benefits and Tradeoffs. Proc. AAAI-99, Orlando..
8. Jeroslow, R.E., and J.Wang. 1990. Solving propositional satisfiability problems. Annals of Mathematics and AI1.
9. Kamphampati, S. 1999. Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan. To be published: Journal AI Research.
10. Kambhampati, S.; Parker, E.; and Lambrecht, E. 1997. Understanding and extending graphplan. Proc. ECP.
11. Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning, Propositional Logic and Stochastic Search. Proc. AAAI 96.
12. Kautz, H., and Selman, B. 1998. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. Workshop Planning as Combinatorial Search, AIPS-98, Pittsburgh, PA, 1998.
13. Kautz, H., and Selman, B. 1999. Unifying SAT-based and Graph-based Planning. Proc. IJCAI99.
14. Li, C.M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. Proc IJCAI-97.
15. McDermott, D. 1998. AIPS-98 Planning Competition Results. At ftp.cs.yale.edu/pub/mcdermott/aipscompresults.html.
16. Nebel, B.; Dimopoulos, Y.; and Koehler, J. 1997. Ignoring irrelevant facts and operators in plan generation. Proc. ECP-97.
17. Weld, D. 1999. Recent Advances in AI Planning. AI Magazine, 1999.