Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
From MaRDI portal
Publication:3532468
DOI10.1007/978-3-540-87803-2_18zbMath1178.68562MaRDI QIDQ3532468
Miki Hermann, Reinhard Pichler
Publication date: 27 October 2008
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87803-2_18
68T27: Logic in artificial intelligence
Related Items
Counting complexity of propositional abduction, Bounded treewidth as a key to tractability of knowledge representation and reasoning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- The complexity of optimization problems
- Generalizations of Opt P to the polynomial hierarchy
- Probabilistic Horn abduction and Bayesian networks
- Subtractive reductions and complete problems for counting complexity classes
- Complexity of Counting the Optimal Solutions
- The Complexity of Enumeration and Reliability Problems
- The complexity of logic-based abduction
- Computer Science Logic
- Logic Programming and Nonmonotonic Reasoning