Add to ORKGAbstract. The paper presents two new compilation schemes of De-composable Negation Normal Form (DNNF) theories into Conjunc-tive Normal Form (CNF) and Linear Integer Programming (MIP), re-spectively. 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 ran-dom as well as real-world CSP-problems.
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class o...
International audienceChoosing a language for knowledge representation and reasoning involves a trad...
International audienceTwo major considerations when encoding pseudo-Boolean (PB) constraints into SA...
We present a compiler for converting CNF formulas into de-terministic, decomposable negation normal ...
Abstract. Decomposable negation normal form (DNNF) was developed primar-ily for knowledge compilatio...
Compilation into propositional languages finds a growing number of practical uses, including in cons...
Subsets of the Negation Normal Form formulas (NNFs) of propositional logic have received much attent...
International audienceSubsets of the Negation Normal Form formulas (NNFs) of propositional logic hav...
International audienceCompilation into propositional languages finds a growing number of practical u...
International audienceBottom-up knowledge compilation is a paradigm for generating representations o...
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a giv...
An NNF circuit is a directed acyclic graph (DAG), where each leaf is labelled with either true/false...
Knowledge compilation (KC) languages find a growing number of practical uses, including in Constrain...
Proving completeness of NC-resolution under a linear restriction has been elusive; it is proved here...
This report gives an outline of the theoretical and practical framework for the implementation of a ...
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class o...
International audienceChoosing a language for knowledge representation and reasoning involves a trad...
International audienceTwo major considerations when encoding pseudo-Boolean (PB) constraints into SA...
We present a compiler for converting CNF formulas into de-terministic, decomposable negation normal ...
Abstract. Decomposable negation normal form (DNNF) was developed primar-ily for knowledge compilatio...
Compilation into propositional languages finds a growing number of practical uses, including in cons...
Subsets of the Negation Normal Form formulas (NNFs) of propositional logic have received much attent...
International audienceSubsets of the Negation Normal Form formulas (NNFs) of propositional logic hav...
International audienceCompilation into propositional languages finds a growing number of practical u...
International audienceBottom-up knowledge compilation is a paradigm for generating representations o...
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a giv...
An NNF circuit is a directed acyclic graph (DAG), where each leaf is labelled with either true/false...
Knowledge compilation (KC) languages find a growing number of practical uses, including in Constrain...
Proving completeness of NC-resolution under a linear restriction has been elusive; it is proved here...
This report gives an outline of the theoretical and practical framework for the implementation of a ...
Combinatorial and learnability results are proven for projective disjunctive normal forms, a class o...
International audienceChoosing a language for knowledge representation and reasoning involves a trad...
International audienceTwo major considerations when encoding pseudo-Boolean (PB) constraints into SA...