A theory of diagnosis from first principles
Artificial Intelligence
A logical framework for default reasoning
Artificial Intelligence
Default theories of Poole-type and a method for constructing cumulative versions of default logic
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
Support set selection for abductive and default reasoning
Artificial Intelligence
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Representation theory for default logic
Annals of Mathematics and Artificial Intelligence
Abductive framework for nonmonotonic theory change
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Inductive equivalence of logic programs
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Hi-index | 0.00 |
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In this work, we will give two definitions of abductive equivalence. The first one, explainable equivalence, requires that two abductive programs have the same explainability for any observation. Another one, explanatory equivalence, guarantees that any observation has exactly the same explanations in each abductive framework. Explanatory equivalence is a stronger notion than explainable equivalence. In first-order abduction, explainable equivalence can be verified by the notion of extensional equivalence in default theories. In nonmonotonic logic programs, explanatory equivalence can be checked by means of the notion of relative strong equivalence. We also show the complexity results for abductive equivalence.