Learn More
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and eeects of actions and the initial state of the world. This allows programs to reason about the state of the world and(More)
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program's completion, we obtain a one-to-one correspondence between the answer sets of the program and the models of(More)
One way to think about a STRIPS operator is as a mapping from databases to databases, in the following sense: suppose we want to know what the world would be like if an action, represented by the STRIPS operator (Y, were done in some world, represented by the STRIPS database Do. To find out, simply perform the operator (Y on DO (by applying (Y’S elementary(More)
This paper makes the following two contributions to formal theories of actions: Showing that a causal minimization framework can be used effectively to specify the effects of indeterminate actions; and showing that for certain classes of such actions, regression, an effective computational mechanism, can be used to reason about them. Logical Preliminaries(More)
Given a propositional theory T and a proposition q, a suucient condition of q is one that will make q true under T , and a necessary condition of q is one that has to be true for q to be true under T. In this paper , we propose a notion of strongest necessary and weakest suucient conditions. Intuitively, the strongest necessary condition of a proposition is(More)