Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
A logical framework for default reasoning
Artificial Intelligence
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
On the equivalence between disjunctive and abductive logic programs
Proceedings of the eleventh international conference on Logic programming
Fundamenta Informaticae
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Recovery of (non)monotonic theories
Artificial Intelligence
Enhancing model checking in verification by AI techniques
Artificial Intelligence
Computing extended abduction through transaction programs
Annals of Mathematics and Artificial Intelligence
Database Updates through Abduction
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Abduction over 3-Valued Extended Logic Programs
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Updating Extended Logic Programs through Abduction
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
The Diagnosis Frontend of the dlv system
AI Communications
Learning extended logic programs
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Abductive framework for nonmonotonic theory change
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Abduction in Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
| Hi-index | 0.00 |
To explain positive observations and unexplain negative observations from nonmonotonic background theories, Inoue and Sakama (1995) extended traditional abduction by allowing removal as well as addition of hypotheses. In this paper, we propose a new characterization of extended abduction in which a background theory is written in any logic program possibly containing disjunctions. In this characterization, both removal of hypotheses and anti-explanations can be represented within the framework of traditional abductive logic programming. Using this transformation, updating knowledge bases represented in logic programs as well as restoring consistency for them can also be computed by existing proof procedures for logic programming.