2012 | OriginalPaper | Buchkapitel
Dsharp: Fast d-DNNF Compilation with sharpSAT
verfasst von : Christian Muise, Sheila A. McIlraith, J. Christopher Beck, Eric I. Hsu
Erschienen in: Advances in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Knowledge compilation is a compelling technique for dealing with the intractability of propositional reasoning. One particularly effective target language is Deterministic Decomposable Negation Normal Form (d-DNNF). We exploit recent advances in #SAT solving in order to produce a new state-of-the-art CNF → d-DNNF compiler: D
sharp
. Empirical results demonstrate that D
sharp
is generally an order of magnitude faster than
c
2
d
, the de facto standard for compiling to d-DNNF, while yielding a representation of comparable size.