(Enter summary)
Abstract: this paper, we generalize the program transformation techniques of [17] for non-abductive programs to deal with abductive frameworks. We introduce a new translation from an abductive logic program into a positive disjunctive program, and show that the belief models of an abductive program can be characterized by the fixpoint closure of the transformed disjunctive program. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are... (Update)
Cited by: More
Preferred Answer Sets for Ordered Logic Programs - Van Nieuwenborgh, Vermeir (2004)
(Correct)
Ordered Programs as Abductive Systems - Van Nieuwenborgh, Vermeir (2003)
(Correct)
Order and Negation as Failure - Van Nieuwenborgh, Vermeir (2003)
(Correct)
Similar documents (at the sentence level):
16.4%: Transforming Abductive Logic Programs to Disjunctive Programs - Inoue, Sakama (1993)
(Correct)
Active bibliography (related documents): More All
0.5: Abductive Logic Programming and Disjunctive Logic Programming: .. - Sakama, Inoue (1999)
(Correct)
0.5: An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993)
(Correct)
0.4: Vol. 7(2002): Nr 7 - Linkoping Sweden Http
(Correct)
Similar documents based on text: More All
0.6: Computing Extended Abduction Through Transaction Programs - Inoue, Sakama (1999)
(Correct)
0.4: Paraconsistent Stable Semantics for Extended Disjunctive Programs - Sakama, Inoue (1995)
(Correct)
0.3: Negation As Failure In The Head - Inoue, Sakama (1998)
(Correct)
Related documents from co-citation: More All
9: The Stable Model Semantics for Logic Programming
- Gelfond - 1988
6: Classical Negation in Logic Programs and Disjunctive Databases
- Gelfond, Lifschitz - 1991
5: SATCHMO: A Theorem Prover Implemented in Prolog (context) - Manthey, Bry - 1988
BibTeX entry: (Update)
K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27:107--136, 1996. http://citeseer.ist.psu.edu/inoue96fixpoint.html More
@article{ inoue96fixpoint,
author = "Katsumi Inoue and Chiaki Sakama",
title = "A Fixpoint Characterization of Abductive Logic Programs",
journal = "Journal of Logic Programming",
volume = "27",
number = "2",
pages = "107-136",
year = "1996",
url = "citeseer.ist.psu.edu/inoue96fixpoint.html" }
Citations (may not include all citations):
858
The Stable Model Semantics for Logic Programming
- Gelfond, Lifschitz - 1988
759
Negation as Failure (context) - Clark - 1978
374
Classical Negation in Logic Programs and Disjunctive Databas..
- Gelfond, Lifschitz - 1991
248
The Semantics of Predicate Logic as a Programming Language (context) - van Emden, Kowalski - 1976
212
Abductive Logic Programming
- Kakas, Kowalski et al. - 1992
204
Magic Sets and Other Strange Ways to Implement Logic Program.. (context) - Bancilhon, Maier et al. - 1986
185
On Indefinite Data Bases and the Closed World Assumption (context) - Minker - 1982
156
SATCHMO: A Theorem Prover Implemented in Prolog (context) - Manthey, Bry - 1988
117
the Relationship between Abduction and Deduction
- Console, Dupre et al. - 1991
117
Abduction Compared with Negation by Failure (context) - Eshghi, Kowalski - 1989
105
Making Prolog More Expressive (context) - Lloyd, Topor - 1984
100
Theorist: A Logical Reasoning System for Defaults and Diagno.. (context) - Poole, Goebel et al. - 1987
88
Generalized Stable Models: A Semantics for Abduction (context) - Kakas, Mancarella - 1990
65
Abduction versus Closure in Causal Theories (context) - Konolige - 1992
64
Stable Models and Non-Determinism in Logic Programs with Neg.. (context) - Sacca, Zaniolo - 1990
57
Intensional Updates: Abduction via Deduction (context) - Bry - 1990
56
Linear Resolution for Consequence Finding (context) - Inoue - 1992
51
Embedding Negation as Failure into a Model Generation Theore.. (context) - Inoue, Koshimura et al. - 1992
49
A Fixpoint Semantics for Disjunctive Logic Programs (context) - Minker, Rajasekar - 1990
46
Negations as Hypotheses: An Abductive Foundation for Logic P.. (context) - Dung - 1991
41
An Alternative Approach to the Semantics of Disjunctive Logi.. (context) - Sakama, Inoue - 1994
31
A Model Generation Theorem Prover in KL1 Using a Ramified-St.. (context) - Fujita, Hasegawa - 1991
27
On Positive Occurrences of Negation as Failure
- Inoue, Sakama - 1994
26
A Query Evaluation Method for Abductive Logic Programming (context) - Satoh, Iwayama - 1992
21
Hypothetical Reasoning in Logic Programs (context) - Inoue - 1994
21
Transforming Abductive Logic Programs to Disjunctive Program..
- Inoue, Sakama - 1993
19
Paraconsistent Stable Semantics for Extended Disjunctive Pro..
- Sakama, Inoue - 1995
17
Consistency-based and Abductive Diagnoses as Generalized Sta.. (context) - Preist, Eshghi - 1992
17
the Equivalence between Disjunctive and Abductive Logic Prog..
- Sakama, Inoue - 1994
16
Computing Abduction by Using the TMS (context) - Satoh, Iwayama - 1991
14
the Duality of Abduction and Model Generation (context) - Denecker, De Schreye - 1992
12
Epistemic Approach to Formalization of Commonsense Reasoning (context) - Gelfond - 1990
11
Bottom-up Abduction by Model Generation (context) - Inoue, Ohta et al. - 1993
5
Problem Solving with the NM-ATMS (context) - Dressler - 1990
4
Knowledge Assimilation and Abduction (context) - Kakas, Mancarella - 1991
4
Annals of Mathematics and Artificial Intelligence (context) - Fernandez, Lobo et al. - 1993
3
Computing Perfect Models of Disjunctive Stratified Databases (context) - Fernandez, Minker - 1991
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC