(Enter summary)
Abstract: A long outstanding problem for abduction in logic programming has been on how
minimality might be defined. Without minimality, an abductive procedure is often required
to generate exponentially many subsumed explanations for a given observation. (Update)
Cited by: More
A New Framework for Knowledge Revision of Abductive Agents.. - Bracciali, Torroni (2004)
(Correct)
Abductive Logic Programming with CIFF.. - Endriss.. (2004)
(Correct)
Similar documents (at the sentence level):
12.1%: Abduction in Logic Programming: A New Definition and an.. - Lin, You (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Two-Literal Logic Programs and Satisfiability - Representation Of Stable
(Correct)
0.2: The Role of Abduction in Logic Programming - Kakas, Kowalski, Toni (1998)
(Correct)
0.2: On Strongest Necessary and Weakest Sufficient - Conditions Fangzhen Lin
(Correct)
Similar documents based on text: More All
0.1: Abduction in Logic Programming - Denecker, Kakas
(Correct)
0.1: Recycling Computed Answers in Rewrite Systems for Abduction - Fangzhen Lin Jia-Huai
(Correct)
0.1: Representing Incomplete Knowledge in Abductive Logic.. - Denecker, De Schreye (1993)
(Correct)
Related documents from co-citation: More All
2: Abduction Compared with Negation by Failure (context) - Eshghi, Kowalski - 1989
BibTeX entry: (Update)
F. Lin and J.-H. You. Abduction in logic programming: A new definition and an abductive procedure based on rewriting. Artif. Intell., 140(1/2):175--205, 2002. http://citeseer.ist.psu.edu/lin02abduction.html More
@inproceedings{ lin01abduction,
author = "Fangzhen Lin and Jia-Huai You",
title = "Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting",
booktitle = "{IJCAI}",
pages = "655-666",
year = "2001",
url = "citeseer.ist.psu.edu/lin02abduction.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
759
Negation as failure (context) - Clark - 1978
343
Introduction to Metamathematics (context) - Kleene - 1971
117
the relationship between abduction and deduction
- Console, Theseider et al. - 1991
117
Abduction compared with negation by failure (context) - Eshghi, Kowalski - 1989
107
Foundations of assumption-based truth maintenance systems: p.. (context) - Reiter, de Kleer - 1987
98
Extended stable semantics for normal and disjunctive logic p.. (context) - Przymusinski - 1990
90
Stable models and an alternative logic programming paradigm
- Marek, Truszczynski - 1999
88
Generalized stable models: a semantics for abduction (context) - Kakas, Mancarella - 1990
82
Signed data dependencies in logic programs (context) - Kunen - 1989
68
Extending and implementing the stable model semantics
- Simons, Niemela et al.
66
The role of abduction in logic programming
- Kakas, Kowalski et al. - 1995
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
54
Embracing causality in specifying the indirect effects of ac..
- Lin - 1985
54
Consistency of Clark's completion and existence of stable mo..
- Fages - 1994
50
The iff proof procedure for abductive logic programming (context) - Fung, Kowalski - 1997
40
SLDNFA: an abductive procedure for normal abductive programs
- Denecker, De Schreye - 1998
40
Representing knowledge for logic-based diagnosis
- Poole - 1988
39
the equivalence of semantics for normal logic programs
- You, Yuan - 1995
38
Logic programs with stable model semantics as a constraint p..
- Niemela - 1999
28
An argumentation theoretic foundation for logic programming (context) - Dung - 1995
26
A query evaluation method for abductive logic programming (context) - Satoh, Iwayama - 1992
24
Completed logic programs and their consistency (context) - Sato - 1990
24
A three-valued semantics for deductive databases and logic p.. (context) - You, Yuan - 1994
23
An analysis of loop checking mechanisms for logic programs (context) - Bol, Krzysztof et al. - 1991
22
ACLP: abductive constraint logic programming
- Kakas, Michael et al. - 2000
11
Computing abduction using the TMS (context) - Satoh, Iwayama - 1991
5
From causal theories to successor state axioms: bridging the.. (context) - Lin - 2000
3
Extending negation as failure by abduction: A three-valued s.. (context) - Giordano, Martelli et al. - 1996
2
Answer set programming (context) - Lifschitz - 1999
1
Classic negation in logic programs and disjunctive database (context) - Gelfond, Lifschitz - 1991
1
DLV: a disjunctive datalog system (context) - Leone - 2000
1
Confluent reductions: abstract perperties and applications t.. (context) - Huet - 1980
1
From causal theories to logic programs (context) - Lin, Wang - 1999
Documents on the same site (http://web.cs.ualberta.ca/~you/papers/pub.html): More
On the Equivalence of Semantics for Normal Logic Programs - You, Yuan (1995)
(Correct)
A Default Interpretation of Defeasible Network - Xianchang Wang (1997)
(Correct)
An Abductive Semantics for Disjunctive Logic Programs and its.. - Jia-Huai You (1997)
(Correct)
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