Planning Graphs and Knowledge Compilation

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 662-672

  Geffner, Héctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DIRECTED GRAPHS; ENCODING (SYMBOLS); GRAPHIC METHODS; ITERATIVE METHODS;

CLASSICAL PLANNING; CONSTRAINED-DIRECTED SEARCH; GRAPHPLAN; IMPLICIT CONSTRAINTS; KNOWLEDGE COMPILATION; LAYERED STRUCTURES; LOW BOUND; PLANNING GRAPHS; REGRESSION SEARCH; SEARCH TREES;

TREES (MATHEMATICS);

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

References (34)

1. Anderson, C.; Smith, D.; and Weld, D. 1998. Conditional effects in graphplan. Proc. AIPS-98, 44-53. AAAI Press.
2. Baioletti, M.; Marcugini, S.; and Milani, A. 2000. DPPlan: An algorithm for fast solution extraction from a planning graph. In Proc. AIPS-2000.
3. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of IJCAI-95, 1636-1642.
4. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
5. Brafman, R., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In Proc. ICAPS-04.
6. Brafman, R. 2001. On reachability, relevance, and resolution in the planning as satisfiability approach. JAIR 14:1-28.
7. Bylander, T. 1994. The computational complexity of STRIPS planning. Artificial Intelligence 69:165-204.
8. Cadoli, M., and Donini, F. 1997. A survey on knowledge compilation. AI Communications 10(3-4):137-150.
9. Cimatti, A., and Roveri, M. 2000. Conformant planning via symbolic model checking. Journal of Artificial Intelligence Research 13:305-338.
10. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1-2):35-84.
11. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. Journal of Artificial Intelligence Research 17:229-264.
12. Darwiche, A., and Pearl, J. 1994. Symbolic causal networks. Proceedings AAAI-94, 238-244.
13. Darwiche, A. 1996. Utilizing knowledge-base semantics in graph-based algorithms. In Proc. AAAI-96, 607-613.
14. Dechter, R. 1999. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113(1-2):41-85.
15. del Val, A. 1999. A new method for consequence finding and compilation in restricted languages. In Proc. AAAI-99, 259-264.
16. Do, M. B., and Kambhampati, S. 2000. Solving the planning-graph by compiling it into CSP. In Proc. AIPS-00, 82-91.
17. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. of the Fifth International Conference on AI Planning Systems (AIPS-2000), 70-82.
18. Kautz, H. A., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), 359-363.
19. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of AAAI-96, 1194-1201. AAAI Press/MIT Press.
20. Kautz, H., and Selman, B. 1999. Unifying SAT-based and Graph-based planning. Proceedings IJCAI-99, 318-327.
21. Koehler, J.; Nebel, B.; Hoffman, J.; and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. Proc. ECP-97. Lect. Notes in AI 1348, 273-285. Springer.
22. Kohlas, J.; Haenni, R.; and Moral, S. 1999. Propositional information systems. J. of Logic and Computation 9(5):651-681.
23. Lopez, A., and Bacchus, F. 2003. Generalizing graphplan by formulating planning as a csp. In Proc. IJCAI-03.
24. Marquis, P. 2000. Consequence finding algorithms. In Gabbay, D., and Smets, P., eds., Handbook on Defeasible Reasoning and Uncertainty Management Systems, volume 5. Kluwer. 41-145.
25. McIlraith, S., and Amir, E. 2001. Theorem proving with structured theories. In Proc. IJCAI-01.
26. Nebel, B. 2000. On the compilability and expressive power of propositional planning. JAIR 12:271-315.
27. Parr, R., and Russell, S. 1995. Approximating optimal policies for partially observable stochastic domains. In Proceedings IJCAI-95.
28. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
29. Rintanen, J. 1998. A planning algorithm not based on directional search. In Proceedings KR'98, 617-624.
30. Rish, I., and Dechter, R. 2000. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning 24(1/2):225-275.
31. Selman, B., and Kautz, H. 1996. Knowledge compilation and theory approximation. Journal of the ACM 43(2):193-224.
32. Smith, D., and Weld, D. 1998. Conformant graphplan. In Proceedings AAAI-98, 889-896. AAAI Press.
33. Smith, D., and Weld, D. 1999. Temporal planning with mutual exclusion reasoning. In Proc. IJCAI-99, 326-337.
34. Tison, P. 1967. Generalized consensus theory and applications to the minimization of boolean circuits. IEEE Transactions on Computers EC-16(4):446-456.