A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Explanation and prediction: an architecture for default and abductive reasoning
Computational Intelligence
Abductive inference models for diagnostic problem-solving
Abductive inference models for diagnostic problem-solving
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Transforming abductive logic programs to disjunctive programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
The complexity of logic-based abduction
Journal of the ACM (JACM)
Resolution for quantified Boolean formulas
Information and Computation
The complexity of default reasoning under the stationary fixed point semantics
Information and Computation
Default reasoning using classical logic
Artificial Intelligence
Semantics and complexity of abduction from default theories
Artificial Intelligence
Abduction from logic program: semantics and complexity
Theoretical Computer Science
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
ACLP: Flexible Solutions to Complex Problems
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Diagnosis Frontend of the dlv system
AI Communications
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Towards efficient default reasoning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A-system: problem solving through abduction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
Generalising the interaction rules in probabilistic logic
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |
Abduction is the process of finding explanations for observed phenomena in accord to known laws about a given application domain. This form of reasoning is an important principle of common-sense reasoning and is particularly relevant in conjunction with nonmonotonic knowledge representation formalisms. In this paper, we deal with a model for abduction in which the domain knowledge is represented in terms of a default theory. We show how the main reasoning tasks associated with this particular form of abduction can be axiomatised within the language of quantified Boolean logic. More specifically, we provide polynomial-time constructible reductions mapping a given abduction problem into a quantified Boolean formula (QBF) such that the satisfying truth assignments to the free variables of the latter determine the solutions of the original problem. Since there are now efficient QBF-solvers available, this reduction technique yields a straightforward method to implement the discussed abduction tasks. We describe a realisation of this approach by appeal to the reasoning system QUIP.