On Compiling CNFs into Structured Deterministic DNNFs

DOI10.1007/978-3-319-24318-4_15zbMath1471.68239OpenAlexW2179600973MaRDI QIDQ3453225

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

A width parameter useful for chordal and co-comparability graphs ⋮ Lower bounds on the mim-width of some graph classes ⋮ Unnamed Item ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Satisfiability of acyclic and almost acyclic CNF formulas
• Parametrized complexity theory.
• Model Counting for Formulas of Bounded Clique-Width
• Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
• Solving MaxSAT and #SAT on Structured CNF Formulas
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Cliquewidth and Knowledge Compilation
• Decomposable negation normal form

This page was built for publication: On Compiling CNFs into Structured Deterministic DNNFs