Reasoning about actions in prioritized default theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 369-381

  Son, Tran Cao ^a   Pontelli, Enrico ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; LOGIC PROGRAMMING;

ACTION THEORY; ANSWER SET PROGRAMMING; DEFAULT THEORY; REASONING ABOUT ACTIONS;

FORMAL LOGIC;

EID: 77952029584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1,2):123-191, 2000.
2. R. Fikes and N. Nilson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3-4):189-208, 1971.
3. M. Gelfond andV. Lifschitz. The Stable Model Semantics for Logic Programs. In ILPS, MIT Press, 1988.
4. M. Gelfond and V. Lifschitz. Action languages. ETAI, 3(6), 1998.
5. M. Gelfond and T.C. Son. Prioritized default theory. In Selected Papers from the Workshop on Logic Programming and Knowledge Representation, pages 164-223. Springer, 1998.
6. M. Ginsberg and D. Smith. Reasoning about actions I. Artificial Intelligence, 35, 1988.
7. R. Kowalski and M. Sergot. A logic-based calculus of events. NGC, 4:67-95, 1986.
8. V. Lifschitz. Answer set planning. In Int. Conf. Logic Programming, pages 23-37, 1999.
9. V. Lifschitz and H. Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh International Conf. on Logic Programming, pages 23-38, 1994.
10. V. Lifschitz and H.Turner. Representing transition systems by logic programs. In Proceedings Int. Conf. on Logic Programming and Nonmonotonic Reasoning, pages 92-106, 1999.
11. J. McCarthy. Epistemological problems of artificial intelligence. In Proceedings Int. Joint Conference on Artificial Intelligence, pages 1038-1044. 1977.
12. J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, volume 4, pages 463-502. 1969.
13. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
14. I. Niemelä and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Procs. LPNMR, pages 420-429, 1997.
15. E. Pednault.ADL and the state-transition model of actions. Journal of Logic and Computation, 4(5):467-513, October 1994.
16. E. Pontelli, G. Gupta, D. Ranjan, and B. Milligan. A Domain Specific Language for Solving Philogenetic Inference Problems. TR-CS-001/2002, New Mexico State University, 2002.
17. E. Pontelli and T. Son. Navigating HTML Tables: Planning, Reasoning, and Agents. In Int. Conference on Assistive Technologies. ACM Press, 2002.
18. T.C. Son, C. Baral, and S. McIlraith. Domain dependent knowledge in planning-an answer set planning approach. In Procs. LPNMR, pages 226-239, Vienna, 2001.
19. T.C. Son and E. Pontelli. Reasoning About Actions in Prioritized Default Theory. TR-CS-002/002, New Mexico State U., 2002.
20. H. Turner. Representing actions in logic programs and default theories. Journal of Logic Programming, 31(1-3):245-298, May 1997.