On computing all abductive explanations from a propositional Horn theory
From MaRDI portal
Publication:3546348
DOI10.1145/1284320.1284323zbMath1312.68177OpenAlexW2085261789MaRDI QIDQ3546348
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1284320.1284323
Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)
Related Items (4)
What makes propositional abduction tractable ⋮ Unique key Horn functions ⋮ Unranking of small combinations from large sets ⋮ Self-duality of bounded monotone Boolean functions and related problems
This page was built for publication: On computing all abductive explanations from a propositional Horn theory
