Representing transition systems by logic programs

Vladimir Lifschitz; Hudson Turner

doi:10.1007/3-540-46767-X_7

Representing transition systems by logic programs

Vladimir Lifschitz, Hudson Turner

Computer Science (Duluth)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

53 Scopus citations

Abstract

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 language	English (US)
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings
Editors	Nicola Leone, Gerald Pfeifer, Michael Gelfond
Publisher	Springer Verlag
Pages	92-106
Number of pages	15
ISBN (Print)	3540667490, 9783540667490
DOIs	https://doi.org/10.1007/3-540-46767-X_7
State	Published - 1999
Event	5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, United States Duration: Dec 2 1999 → Dec 4 1999

Publication series

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

Other

Other	5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999
Country/Territory	United States
City	El Paso
Period	12/2/99 → 12/4/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Access

10.1007/3-540-46767-X_7

OpenUrl availability

Full text

Cite this

Lifschitz, V., & Turner, H. (1999). Representing transition systems by logic programs. In N. Leone, G. Pfeifer, & M. Gelfond (Eds.), Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings (pp. 92-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730). Springer Verlag. https://doi.org/10.1007/3-540-46767-X_7

Representing transition systems by logic programs. / Lifschitz, Vladimir; Turner, Hudson.
Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. ed. / Nicola Leone; Gerald Pfeifer; Michael Gelfond. Springer Verlag, 1999. p. 92-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lifschitz, V & Turner, H 1999, Representing transition systems by logic programs. in N Leone, G Pfeifer & M Gelfond (eds), Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1730, Springer Verlag, pp. 92-106, 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999, El Paso, United States, 12/2/99. https://doi.org/10.1007/3-540-46767-X_7

Lifschitz V, Turner H. Representing transition systems by logic programs. In Leone N, Pfeifer G, Gelfond M, editors, Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. Springer Verlag. 1999. p. 92-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46767-X_7

Lifschitz, Vladimir ; Turner, Hudson. / Representing transition systems by logic programs. Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. editor / Nicola Leone ; Gerald Pfeifer ; Michael Gelfond. Springer Verlag, 1999. pp. 92-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7e573c8a39054672bb3d81706ef79522,

title = "Representing transition systems by logic programs",

abstract = "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.",

author = "Vladimir Lifschitz and Hudson Turner",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 ; Conference date: 02-12-1999 Through 04-12-1999",

year = "1999",

doi = "10.1007/3-540-46767-X_7",

language = "English (US)",

isbn = "3540667490",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "92--106",

editor = "Nicola Leone and Gerald Pfeifer and Michael Gelfond",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings",

}

TY - GEN

T1 - Representing transition systems by logic programs

AU - Lifschitz, Vladimir

AU - Turner, Hudson

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958675998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958675998&partnerID=8YFLogxK

U2 - 10.1007/3-540-46767-X_7

DO - 10.1007/3-540-46767-X_7

M3 - Conference contribution

AN - SCOPUS:84958675998

SN - 3540667490

SN - 9783540667490

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

SP - 92

EP - 106

BT - Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings

A2 - Leone, Nicola

A2 - Pfeifer, Gerald

A2 - Gelfond, Michael

PB - Springer Verlag

T2 - 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999

Y2 - 2 December 1999 through 4 December 1999

ER -

Representing transition systems by logic programs

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this