Planning as satisfiability with preferences

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 987-992

  Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; PATTERN RECOGNITION; PROBLEM SOLVING;

CLASSICAL PLANNING; INTERNATIONAL PLANNING COMPETITION (IPC);

STRATEGIC PLANNING;

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

References (16)

1. O. Bailleux and Y. Boufkhad. Efficient CNF encoding of Boolean cardinality constraints. In Proc. CP, pages 108-122, 2003.
2. M. Bienvenu, C. Fritz, and S. McIlraith. Planning with qualitative temporal preferences. In Proc. KR, 2006.
3. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. Preference-based constrained optimization with CP-nets. Computational Intelligence, 20(2):137-157, 2004.
4. R. Brafman and Y. Chernyavsky. Planning with goal preferences and constraints. In Proc. ICAPS, pages 182-191, 2005.
5. M. Büttner and J. Rintanen. Satisfiability planning with constraints on the number of actions. In Proc. ICAPS, pages 292-299, 2005.
6. M.B. Do and S. Kambhampati. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artif. Intell., 132(2), 2001.
7. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT, pages 502-518, 2003.
8. A. Gerevini and D. Long. Plan constraints and preferences in PDDL3. In Proc. ICAPS-2006 Workshop on Preferences and Soft Constraints in Planning, pp. 46-53, 2006.
9. E. Giunchiglia and M. Maratea. Solving optimization problems with DLL. In Proc. ECAI, 2006.
10. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act, and the rest will follow: Exploiting determinism in planning as satisfiability. In Proc. AAAI, 1998.
11. J. Hoffmann and S. Edelkamp. The deterministic part of IPC-4: An overview. JAIR, 2005.
12. C. Hsu, B. Wah, R. Huang, and Y. Chen Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences. In Proc. IJCAI, 2007.
13. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI, 1992.
14. Henry A. Kautz and Bart Selman. Unifying SAT-based and graph-based planning. In Proc. IJCAI, 1999.
15. Järvisalo, M.; Junttila, T.; and Niemelä, I. 2005. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4):373-399.
16. Joost P. Warners. A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett., 68(2):63-69, 1998.