To encode or not to encode - 1: Linear planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 988-993

  Brafman, Ronen I ^a   Hoos, Holger R ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL EXPERIMENTS; HAMILTONIAN CIRCUITS; LINEAR PLANNING; PLANNING PROBLEM; PROPOSITIONAL SATISFIABILITY PROBLEMS; SATISFIABILITY PROBLEMS; SPECIAL STRUCTURE; STOCHASTIC LOCAL SEARCHES;

ARTIFICIAL INTELLIGENCE;

ENCODING (SYMBOLS);

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

References (17)

1. C. Backstrom. Computational aspects of reordering plans. Journal of AI Research, 9:99-131, 1998.
2. A. Barrett and D. Weld. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67(1):71-112, 1994.
3. R. I. Brafman. Reachability, relevance, resolution, and the planning as satisfiability approach. In Proc. of IJCAI' 99.
4. M. D. Ernst, T. D. Millstein, and D. S. Weld. Automatic SAT-compilation of planning problems. In Proc. IJCAI'97, 1997.
5. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act and the rest will follow: Exploiting determinism in planning as satisfiability. In Proc. 15th Nat. Con. on AI, 1998.
6. C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. AAAI'98, 1998.
7. H. H. Hoos. SAT-encodings, search space structure, and local search performance. In Proc. IJCAI'99, 1999.
8. H. H. Hoos and T. Stutzle. Evaluating Las Vegas algorithms - pitfalls and remedies. In Proc. UAI'98, 1998.
9. H. Kautz and B. Selman. Planning as satisfiability. In Proc. 10th ECA1, 1992.
10. H. Kautz and B. Selman. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proc. 13th NCAI, pages 1194-1201, 1996.
11. H. Kautz and B. Selman. Blackbox: A new approach to the application of theorem proving to problem solving. In Working notes of the Workshop on Planning as Combinatorial Search, 1998.
12. H. Kautz, D. McAllester, and B. Selman. Exploiting variable dependency in local search. 1997.
13. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proc. UCAI-97, 1997.
14. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In AAAI'97, pages 321-326, 1997.
15. Bart Selman, Henry A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the AAA1 National Conference on Artificial Intelligence, volume 1, pages 337-343, 1994.
16. I. Serina and A. Gerevini. Local search techniques for planning graphs. In Proc. 17th UK Planning and Scheduling WS, pages 157-168, 1998.
17. G. J. Sussman. A Computer Model of Skill Acquisition. MIT Press, 1975.