Complexity Classifications for Propositional Abduction in Post's Framework
From MaRDI portal
Publication:3165755
DOI10.1093/logcom/exr012zbMath1280.68247arXiv1006.4923OpenAlexW1542902132MaRDI QIDQ3165755
No author found.
Publication date: 19 October 2012
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.4923
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Classical propositional logic (03B05) Boolean functions (06E30)
Related Items (5)
Complexity Classifications for Logic-Based Argumentation ⋮ On the complexity of second-best abductive explanations ⋮ The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems ⋮ The Weight in Enumeration ⋮ On the complexity of the clone membership problem
This page was built for publication: Complexity Classifications for Propositional Abduction in Post's Framework
