DMCA
Representing Action and Change by Logic Programs (1993)
| Venue: | Journal of Logic Programming |
| Citations: | 414 - 25 self |
BibTeX
@ARTICLE{Gelfond93representingaction,
author = {Michael Gelfond and Vladimir Lifschitz},
title = {Representing Action and Change by Logic Programs},
journal = {Journal of Logic Programming},
year = {1993},
volume = {17},
pages = {301--322}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics of action based on states and transition functions. 1 Introduction This paper extends the work of Eshghi and Kowalski [6], Evans [7] and Apt and Bezem [1] on representing properties of actions in logic programming languages with negation as failure. Our goal is to overcome some of the limitations of the earlier work. The existing formalizations of action in logic programming are adequate for only the simplest kind of temporal reasoning---"temporal projection." In a temporal projection problem, we are given a description of the initial state of the world, and use properties of actions to determine what the world will look like after a series of actions is performed. Moreover, the existing ...
