Planning graphs and propositional clause-learning

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 535-543

  Rintanen, Jussi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; KNOWLEDGE REPRESENTATION;

AUTOMATED REASONING; BIPARTITE GRAPHS; CLASSICAL PROPOSITIONAL LOGIC; CLAUSE LEARNING; INFERENCE METHODS; PARALLEL PLANS; PLANNING GRAPHS; STATE VARIABLES;

GRAPH THEORY;

EID: 78650613101     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bacchus, F., and Winter, J. 2004. Effective preprocessing with hyper-resolution and equality reduction. In Hoos, H. H., and Mitchell, D. G., eds., Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, 341-355. Springer-Verlag.
2. Bayardo Jr., R. J., and Schrag, R. C. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97), 203-208.
3. Blum, A. L., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):281-300.
4. Brafman, R. I. 2001. A simplifier for propositional formulas with many binary clauses. In Nebel, B., ed., Proceedings of the 17th International Joint Conference on Artificial Intelligence, 515-522. Morgan Kaufmann Publishers.
5. Chen, Y.; Xing, Z.; and Zhang, W. 2007. Long-distance mutual exclusion for propositional planning. In Veloso, M., ed., Proceedings of the 20th International Joint Conference on Artificial Intelligence, 1840-1845. AAAI Press/International Joint Conference on Artificial Intelligence.
6. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM 5:394-397.
7. Dowling, W. F., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1(3):267-284.
8. Ernst, M.; Millstein, T.; and Weld, D. S. 1997. Automatic SAT-compilation of planning problems. In Pollack, M., ed., Proceedings of the 15th International Joint Conference on Artificial Intelligence, 1169-1176. Morgan Kaufmann Publishers.
9. Geffner, H. 2004. Planning graphs and knowledge compilation. In Dubois, D.; Welty, C. A.; and Williams, M.- A., eds., Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), 662-672. AAAI Press.
10. Gerevini, A., and Schubert, L. 1998. Inferring state constraints for domain-independent planning. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 905-912. AAAI Press.
11. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Neumann, B., ed., Proceedings of the 10th European Conference on Artificial Intelligence, 359-363. JohnWiley & Sons.
12. Kautz, H., and Selman, B. 1996. Pushing the envelope: planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, 1194-1201. AAAI Press.
13. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Pollack, M., ed., Proceedings of the 15th International Joint Conference on Artificial Intelligence, 366-371. Morgan Kaufmann Publishers.
14. Marques-Silva, J. P., and Sakallah, K. A. 1996. GRASP: A new search algorithm for satisfiability. In Proceedings of International Conference on Computer-Aided Design, 220-227.
15. Rintanen, J.; Heljanko, K.; and Niemel̈a, I. 2006. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13):1031-1080.
16. Rintanen, J. 1998. A planning algorithm not based on directional search. In Cohn, A. G.; Schubert, L. K.; and Shapiro, S. C., eds., Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), 617-624. Morgan Kaufmann Publishers.
17. Subbarayan, S., and Pradhan, D. K. 2005. NiVER: Non increasing variable elimination resolution for preprocessing SAT instances. In Hoos, H. H., and Mitchell, D. G., eds., Theory and Applications of Satisfiability Testing, 7th International Conference, SAT-2004. Vancouver, BC, Canada, May 10-13, 2004. Revised selected papers, number 3542 in Lecture Notes in Computer Science, 276-291. Springer-Verlag.