New Advances in Compiling CNF to Decomposable Negation Normal Form
نویسنده
چکیده
We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic Decomposable Negation Normal (d-DNNF), which is a tractable logical form that permits model counting in polynomial time. The new implementation is based on latest techniques from both the SAT and OBDD literatures, and appears to be orders of magnitude more efficient than previous algorithms for this purpose. We compare our compiler experimentally to state of the art model counters, OBDD compilers, and previous CNF2dDNNF compilers.
منابع مشابه
On Compiling CNFs into Structured Deterministic DNNFs
We show that the traces of recently introduced dynamic programming algorithms for #SAT can be used to construct structured deterministic DNNF (decomposable negation normal form) representations of propositional formulas in CNF (conjunctive normal form). This allows us prove new upper bounds on the complexity of compiling CNF formulas into structured deterministic DNNFs in terms of parameters su...
متن کاملDsharp: Fast d-DNNF Compilation with sharpSAT
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-ofthe-art CNF → d-DNNF compiler: DSHARP. Empirical results demonstrate that DSHARP is generally an order o...
متن کاملOn Compiling CNF into Decision-DNNF
Decision-DNNF is a strict subset of decomposable negation normal form (DNNF) that plays a key role in analyzing the complexity of model counters (the searches performed by these counters have their traces in Decision-DNNF). This paper presents a number of results on Decision-DNNF. First, we introduce a new notion of CNF width and provide an algorithm that compiles CNFs into Decision-DNNFs in ti...
متن کاملTwo Encodings of DNNF Theories
The paper presents two new compilation schemes of Decomposable Negation Normal Form (DNNF) theories into Conjunctive Normal Form (CNF) and Linear Integer Programming (MIP), respectively. We prove that the encodings have useful properties such as unit propagation on the CNF formula achieves domain consistency on the DNNF theory. The approach is evaluated empirically on random as well as real-wor...
متن کاملFast d-DNNF Compilation with sharpSAT
Knowledge compilation is a valuable tool for dealing with the computational intractability of propositional reasoning. In knowledge compilation, a representation in a source language is typically compiled into a target language in order to perform some reasoning task in polynomial time. One particularly popular target language is Deterministic Decomposable Negation Normal Form (d-DNNF). d-DNNF ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004