Counting Complexity of Minimal Cardinality and Minimal Weight Abduction

DOI10.1007/978-3-540-87803-2_18zbMATH Open1178.68562OpenAlexW1586147820MaRDI 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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of optimization problems
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• Subtractive reductions and complete problems for counting complexity classes
• Probabilistic Horn abduction and Bayesian networks
• The complexity of logic-based abduction
• Complexity of Counting the Optimal Solutions
• Computer Science Logic
• Logic Programming and Nonmonotonic Reasoning
• Generalizations of Opt P to the polynomial hierarchy

Cited In (3)

• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Dörfler marking with minimal cardinality is a linear complexity problem
• Counting complexity of propositional abduction

This page was built for publication: Counting Complexity of Minimal Cardinality and Minimal Weight Abduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532468)