From Causal Theories to Logic Programs (Sometimes)

Authors:
Fangzhen Lin;Kewen Wang
Affiliations:
-;-
Venue:
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
1999

Citing 3
Cited 1

The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
A logic of universal causation

Artificial Intelligence
Embracing causality in specifying the indirect effects of actions

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we shall provide a translation of a class of causal theories in (Lin [3]) to Gelfond and Lifschitz's disjunctive logic programs with classical negation [1]. We found this translation interesting for at least the following two reasons: it provides a basis on which a wide class of causal theories in ([3]) can be computed; and it sheds some new lights on the nature of the causal theories in [3]. Our translation is in many ways similar to the one given in [9,2]. Our main result is a theorem that shows how action precondition and fully instantiated successor state axioms can be computed from the answer sets of the translated logic program.