An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL


We present Abstract CNF2dDNNF, a calculus describing an approach for compiling a formula in conjunctive normal form (CNF) into deterministic negation normal form (d-DNNF). It combines component-based reasoning with a model enumeration approach based on conflict-driven clause learning (CDCL) with chronological backtracking. Its properties, such as soundness and termination, carry over to implementations which can be modeled by it. We provide a correctness proof and a detailed example. The main conceptual differences to currently available tools targeting d-DNNF compilation are discussed and future research directions presented. The aim of this work is to lay the theoretical foundation for a novel method for d-DNNF compilation. To the best of our knowledge, our approach is the first knowledge compilation method using CDCL with chronological backtracking.
Fichier principal
Vignette du fichier
978-3-031-43369-6_11.pdf (1.07 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04315486 , version 1 (30-11-2023)




Sibylle Möhle. An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL. Frontiers of Combining Systems - 14th International Symposium, FroCoS 2023, Sep 2023, Prague, Czech Republic. pp.195 - 213, ⟨10.1007/978-3-031-43369-6_11⟩. ⟨hal-04315486⟩
15 View
11 Download



Gmail Mastodon Facebook X LinkedIn More