On Compiling CNFs into Structured Deterministic DNNFs (Q3453225): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-24318-4_15
+Normal rank
@@ Property / OpenAlex ID @@
+W2179600973
@@ Property / OpenAlex ID: W2179600973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2954991
@@ Property / cites work: Q2954991 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposable negation normal form
@@ Property / cites work: Decomposable negation normal form / rank @@
+Normal rank
@@ Property / cites work @@
+On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
+Normal rank
@@ Property / cites work @@
+Q4411139
@@ Property / cites work: Q4411139 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of acyclic and almost acyclic CNF formulas
+Normal rank
@@ Property / cites work @@
+Q5283031
@@ Property / cites work: Q5283031 / rank @@
+Normal rank
@@ Property / cites work @@
+Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
+Normal rank
@@ Property / cites work @@
+Cliquewidth and Knowledge Compilation
@@ Property / cites work: Cliquewidth and Knowledge Compilation / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MaxSAT and #SAT on Structured CNF Formulas
+Normal rank
@@ Property / cites work @@
+Model Counting for Formulas of Bounded Clique-Width
+Normal rank