Transformations of logic programs related to causality and planning

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logic programming to representing causality and to planning. One theorem is about the use of disjunctive rules to express that an atom is exogenous. The other provides an alternative way of expressing that a plan does not include concurrently executed actions.

Cite

CITATION STYLE

APA

Erdem, E., & Lifschitz, V. (1999). Transformations of logic programs related to causality and planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1730, pp. 107–116). Springer Verlag. https://doi.org/10.1007/3-540-46767-X_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free