The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Abductive inference models for diagnostic problem-solving
Abductive inference models for diagnostic problem-solving
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
The design and analysis of algorithms
The design and analysis of algorithms
Generalizations of Opt P to the polynomial hierarchy
Theoretical Computer Science
Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
On some tractable classes in deduction and abduction
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
A Complete Classification of the Complexity of Propositional Abduction
SIAM Journal on Computing
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
What makes propositional abduction tractable
Artificial Intelligence
Complexity of counting the optimal solutions
Theoretical Computer Science
New polynomial classes for logic-based abduction
Journal of Artificial Intelligence Research
A tractable class of abduction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Updates, actions, and planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Abductive and default reasoning: a computational core
AAAI'90 Proceedings of the eighth National 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
Do hard SAT-related reasoning tasks become easier in the Krom fragment?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence 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 settings.