On the complexity of second-best abductive explanations

DOI10.1016/j.ijar.2015.05.009zbMath1346.68194arXiv1204.5859OpenAlexW1805424366MaRDI QIDQ899129

Marco Schaerf, Paolo Liberatore

Publication date: 21 December 2015

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5859

zbMATH Keywords

propositional logicknowledge-based systemsabductionknowledge representation techniques

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

On the complexity of second-best abductive explanations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of second-best abductive explanations
• Counting complexity of propositional abduction
• The computational complexity of abduction
• Abduction from logic programs: Semantics and complexity
• Semantics and complexity of abduction from default theories
• Preprocessing of intractable problems
• On some tractable classes in deduction and abduction
• What makes propositional abduction tractable
• Support set selection for abductive and default reasoning
• Complexity Classifications for Propositional Abduction in Post's Framework
• Monotonic reductions, representative equivalence, and compilation of intractable problems
• The complexity of logic-based abduction
• Computer Science Logic
• Computational Complexity
• A Complete Classification of the Complexity of Propositional Abduction