(Enter summary)
Abstract: A new fixpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the fixpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterization allows us to have a parallel bottomup model generation procedure for computing abductive... (Update)
Context of citations to this paper: More
...programs. Second, our fixpoint closure computes not only stable models but also possible models of disjunctive programs. Inoue and Sakama [20] also present yet another fixpoint semantics which characterizes the answer set semantics of extended disjunctive programs, while they...
.... by Datalog ) A different approach to the transformation of abductive logic programs into disjunctive logic programs can be found in [21]. Sakama and Inoue describe in [35] a transformation from abductive logic programs to disjunctive logic programs under the possible model...
Cited by: More
Ordered Programs as Abductive Systems - Van Nieuwenborgh, Vermeir (2003)
(Correct)
Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel
(Correct)
The Diagnosis Frontend of the dlv System - Eiter, Faber, Leone, Pfeifer (1999)
(Correct)
Similar documents (at the sentence level):
25.8%: A Fixpoint Characterization Of Abductive Logic Programs - Inoue, Sakama (1996)
(Correct)
Active bibliography (related documents): More All
0.6: An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993)
(Correct)
0.5: Negation in Disjunctive Logic Programs - Sakama, Inoue (1993)
(Correct)
0.2: Abductive Logic Programming - Kakas, Kowalski, Toni (1993)
(Correct)
Similar documents based on text: More All
1.2: Relating Disjunctive Logic Programs to Default Theories - Chiaki Sakama Astem (1993)
(Correct)
0.5: On the Equivalence between Disjunctive and Abductive Logic.. - Sakama, Inoue (1994)
(Correct)
0.5: Paraconsistent Stable Semantics for Extended Disjunctive Programs - Sakama, Inoue (1995)
(Correct)
Related documents from co-citation: More All
13: Abduction Compared with Negation by Failure (context) - Eshghi, Kowalski - 1989
13: The Stable Model Semantics for Logic Programming
- Gelfond - 1988
12: Generalized Stable Models: A Semantics for Abduction (context) - Kakas, Mancarella - 1990
BibTeX entry: (Update)
Inoue, K. and Sakama, C., Transforming Abductive Logic Programs to Disjunctive Programs, in: D. S. Warren (ed.), Logic Programming: Proceedings of the Tenth International Conference, MIT Press, 1993, pp. 335--353. http://citeseer.ist.psu.edu/inoue93transforming.html More
@inproceedings{ inoue93transforming,
author = "Katsumi Inoue and Chiaki Sakama",
title = "Transforming Abductive Logic Programs to Disjunctive Programs",
booktitle = "International Conference on Logic Programming",
pages = "335-353",
year = "1993",
url = "citeseer.ist.psu.edu/inoue93transforming.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
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
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
31
A model generation theorem prover in KL1 using a ramified-st.. (context) - Fujita, Hasegawa - 1991
24
Extended logic programs with default assumptions (context) - Inoue - 1991
17
Consistency-based and abductive diagnoses as generalized sta.. (context) - Preist, Eshghi - 1992
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
7
Logic and Computation (context) - Console, Dupre et al. - 1991
6
stable model semantics (context) - Fernandez, Lobo et al. - 1991
3
Computing perfect models of disjunctive stratified databases (context) - Fernandez, Minker - 1991
2
A uniform approach to fixpoint characterization of disjuncti.. (context) - Inoue, Sakama - 1992
1
Foundations of first-order databases (context) - Decker - 1992
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