The complexity of logic-based abduction
From MaRDI portal
Publication:4369855
DOI10.1145/200836.200838zbMath0886.68121WikidataQ59259763 ScholiaQ59259763MaRDI QIDQ4369855
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/200836.200838
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, Consistency restoration and explanations in dynamic CSPs---Application to configuration, Enhancing disjunctive logic programming systems by SAT checkers, Complexity results for explanations in the structural-model approach, Approximating cost-based abduction is NP-hard, Succinctness as a source of complexity in logical formalisms, Abduction from logic programs: Semantics and complexity, Abductive consequence relations, Semantics and complexity of abduction from default theories, Prioritized logic programming and its application to commonsense reasoning, Default reasoning from conditional knowledge bases: Complexity and tractable cases, Ordered binary decision diagrams as knowledge-bases, Conditional independence in propositional logic., Reasoning with ordered binary decision diagrams, A decision method for nonmonotonic reasoning based on autoepistemic reasoning, On some tractable classes in deduction and abduction, Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results, What makes propositional abduction tractable, Semantic forgetting in answer set programming, Outlier detection using default reasoning, On look-ahead heuristics in disjunctive logic programming, Comparing action descriptions based on semantic preferences, A split-combination approach to merging knowledge bases in possibilistic logic, Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
