Representing transition systems by logic programs

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

Volumn 1730, Issue , 1999, Pages 92-106

  Lifschitz, Vladimir ^a   Turner, Hudson ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF MINNESOTA DULUTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

ACTION LANGUAGE; ANSWER SET; ANSWER SET SEMANTICS; CAUSAL THEORY; COMMONSENSE REASONING; LOGIC PROGRAMS; TRANSITION SYSTEM;

COMPUTER CIRCUITS;

EID: 84958675998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_7     Document Type: Conference Paper

References (16)

1. Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
2. Yannis Dimopoulos, Bernhard Nebel, and Jana Koehler. Encoding planning problems in non-monotonic logic programs. In Proc. European Conf. on Planning 1997, pages 169-181, 1997.
3. Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, and Francesco Scarcello. The KR system DLV: Progress report, comparisons and benchmarks. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int’l Conf. on Principles of Knowledge Representation and Reasoning, pages 406-417, 1998
4. Francois Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
5. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases.New Generation Computing, 9:365-385, 1991.
6. Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3, 1998. Available at http://www.ep.liu.se/ea/cis/1998/016/.
7. Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623-630, 1998.
8. Vladimir Lifschitz. Foundations of logic programming. In Principles of Knowledge Representation, pages 69-127. CSLI Publications, 1996.
9. Vladimir Lifschitz. Action languages, answer sets and planning. In The Logic Programming Paradigm: a 25-Year Perspective, pages 357-373. Springer Verlag, 1999.
10. Norman McCain. Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin, 1997.
11. Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460-465, 1997.
12. Norman McCain and Hudson Turner.Satisfiability planning with causal theories. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int'l Conf. on Principles of Knowledge Representation and Reasoning, pages 212-223, 1998.
13. Ilkka Niemela and Patrik Simons.Efficient implementation of the well-founded and stable model semantics. In Proc. Joint Int’l Conf. and Symp. on Logic Programming, pages 289-303, 1996.
14. Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245-298, 1997.
15. Hudson Turner. Causal Action Theories and Satisfiability Planning. PhD thesis, University of Texas at Austin, 1998.
16. Hantao Zhang. An efficient propositional prover. In Proc. CADE-97, 1997.