Planning with preferences using logic programming

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 247-260

  Son, Tran Cao ^a   Pontelli, Enrico ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; DATA STRUCTURES; IDENTIFICATION (CONTROL SYSTEMS); PROBLEM SOLVING; SEMANTICS; SET THEORY; SIGNAL ENCODING; TRAJECTORIES; UTILITY PROGRAMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING;

DECLARATIVE LANGUAGE; DOMAIN-SPECIFIC KNOWLEDGE; MULTI-DIMENSIONAL PREFERENCES; SUBSETS;

LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; DECLARATIVE LANGUAGES; MULTI DIMENSIONAL; NON-TRIVIAL; PLANNING PROBLEM;

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

References (25)

1. Y. Babovich. "CMODELS", www.cs.utexas.edu/users/tag/cmodels.html.
2. F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1,2):123-191, 2000.
3. S. Bistarelli et al. Labeling and Partial Local Consistency for Soft Constraint Programming. In Practical Aspects of Declarative Languages, Springer Verlag, 2000.
4. A.L. Blum and M.L. Furst. Fast Planning through Planning Graph Analysis. AIJ, 90, 1997.
5. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. AIJ, 109, 1999.
6. A. Cimatti and M. Roveri. Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research, 13:305-338, 2000.
7. B. Cui and T. Swift. Preference Logic Grammars: Fixed Point Semantics and Application to Data Standardization. Artificial Intelligence, 138(1-2):117-147, 2002.
8. J. Delgrande, T. Schaub, and H. Tompits. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, 3(2):129-187, March 2003.
9. T. Eiter et al. Answer Set Planning under Action Cost. In JELIA. Springer Verlag, 2002.
10. T. Eiter et al. The KR System dlv: Progress Report, Comparisons, and Benchmarks. In Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 406-417, 1998.
11. F. Fages, J. Fowler, and T. Sola. Handling Preferences in Constraint Logic Programming with Relational Optimization. In PLILP Springer Verlag, 1994.
12. M. Gelfond and V. Lifschitz. Action languages. ETAI, 3(6), 1998.
13. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. ICLP'88.
14. P. Haddawy and S. Hanks. Utility Model for Goal-Directed Decision Theoretic Planners. Technical report, University of Washington, 1993.
15. H. Kautz and J.P. Walser. State-space Planning by Integer Optimization. In AAAI, 1999.
16. H. Le, E. Pontelli, T.C. Son. A Java Solver for Answer Set Programming, NMSU, 2003.
17. V. Lifschitz. Answer set planning. In ICLP, pages 23-37, 1999.
18. D. Long et al. International Planning Competition.
19. K.L. Myers. Strategic Advice for Hierarchical Planners. In KR'96.
20. K.L. Myers and T.J. Lee. Generating Qualitatively Different Plans through Metatheoretic Biases. In AAAI, 1999.
21. I. Niemelä and P. Simons. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In LPNMR, Springer, pages 420-429, 1997.
22. M.L. Putterman. Markov Decision Processes - Discrete Stochastic Dynamic Programming. John Willey & Sons, Inc., New York, NY, 1994.
23. T. Schaub et al. A Comparative Study of Logic Programs with Preferences. IJCAI, 2001.
24. T.C. Son, C. Baral, and S. McIlraith. Domain dependent knowledge in planning - an answer set planning approach. In LPNMR, Springer, pages 226-239, 2001.
25. T.C. Son and E. Pontelli. Reasoning about actions in prioritized default theory. In JELIA, 2002.