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
Database updates through abduction
Proceedings of the sixteenth international conference on Very large databases
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)
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
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
Inference of gene relations from microarray data by abduction
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
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. We have recently started to study the counting complexity of propositional abduction. However, several important cases have been left open, namely, the cases when we restrict ourselves to solutions with minimal cardinality or with minimal weight. These cases --- possibly combined with priorities --- are now settled in this paper. We thus arrive at a complete picture of the counting complexity of propositional abduction.