Causal logic programming

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

Abstract

In this work, we present a causal extension of logic programming under the stable models semantics where, for a given stable model, we capture the alternative causes of each true atom. The syntax is extended by the simple addition of an optional reference label per each rule in the program. Then, the obtained causes rely on the concept of a causal proof: an inverted tree of labels that keeps track of the ordered application of rules that has allowed deriving a given true atom. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cabalar, P. (2012). Causal logic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7265, 102–116. https://doi.org/10.1007/978-3-642-30743-0_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