Abductive inference models for diagnostic problem-solving
Abductive inference models for diagnostic problem-solving
Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Database Updates through Abduction
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Updates, actions, and planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Inference of gene relations from microarray data by abduction
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
What makes propositional abduction tractable
Artificial Intelligence
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Test Generation for Model-Based Diagnosis
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Efficient datalog abduction through bounded treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Approximate model-based diagnosis using greedy stochastic search
Journal of Artificial Intelligence Research
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Abduction is an important method of non-monotonic reasoning with many applications in AI and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. Decision problems of great interest are the existence and the relevance problems. The complexity of these decision problems has been systematically studied while the counting complexity of propositional abduction has remained obscure. The goal of this work is to provide a comprehensive analysis of the counting complexity of propositional abduction in various classes of theories.