Representing transition systems by logic programs

Vladimir Lifschitz, Hudson Turner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

53 Scopus citations


This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. The translations from C into logic programming that we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in C and to generate plans in such domains.

Original languageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings
EditorsNicola Leone, Gerald Pfeifer, Michael Gelfond
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540667490, 9783540667490
StatePublished - 1999
Event5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, United States
Duration: Dec 2 1999Dec 4 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999
Country/TerritoryUnited States
CityEl Paso

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.


Dive into the research topics of 'Representing transition systems by logic programs'. Together they form a unique fingerprint.

Cite this