Planning with SAT, admissible heuristics and A

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 2015-2020

  Rintanen, Jussi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DOMINANCE RELATION; ITERATIVE DEEPENING; OPTIMAL PLANNING ALGORITHMS; SAT PROBLEMS;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS;

ITERATIVE METHODS;

EID: 84878789520     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-336     Document Type: Conference Paper

References (14)

1. José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural Complexity I. Springer-Verlag, Berlin, 1988.
2. Paul Beame, Henry Kautz, and Ashish Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004.
3. Blai Bonet and Héctor Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
4. R.I. Brafman. On reachability, relevance, and resolution in the planning as satisfiability approach. Journal of Artificial Intelligence Research, 14:1-28, 2001. (Pubitemid 33738057)
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
6. Héctor Geffner. Planning graphs and knowledge compilation. In Didier Dubois, Christopher A. Welty, and Mary-Anne Williams, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), pages 662-672, 2004.
7. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum-cost paths. IEEE Transactions on System Sciences and Cybernetics, SSC-4(2):100-107, 1968.
8. Henry Kautz and Bart Selman. Planning as satisfiability. In Bernd Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 359-363. John Wiley & Sons, 1992.
9. R. E. Korf. Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
10. David G. Mitchell. A SAT solver primer. EATCS Bulletin, 85:112-133, February 2005.
11. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
12. K. Pipatsrisawat and A. Darwiche. On the power of clause-learning SAT solvers with restarts. In I. P. Gent, editor, Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, CP 2009, number 5732 in Lecture Notes in Computer Science, pages 654-668. Springer-Verlag, 2009.
13. Jussi Rintanen. Planning graphs and propositional clause-learning. In Gerhard Brewka and Patrick Doherty, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference (KR 2008), pages 535-543. AAAI Press, 2008.
14. Jussi Rintanen. Heuristics for planning with SAT. In David Cohen, editor, Principles and Practice of Constraint Programming - CP 2010, 16th International Conference, CP 2010, St. Andrews, Scotland, September 2010, Proceedings., number 6308 in Lecture Notes in Computer Science, pages 414-428. Springer-Verlag, 2010.