On the complexity of choosing the branching literal in DPLL (Q1978252): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4152212
@@ Property / cites work: Q4152212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687266
@@ Property / cites work: Q5687266 / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Branching rules for satisfiability
@@ Property / cites work: Branching rules for satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Solving propositional satisfiability problems
@@ Property / cites work: Solving propositional satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+How good are branching rules in DPLL?
@@ Property / cites work: How good are branching rules in DPLL? / rank @@
+Normal rank
@@ Property / cites work @@
+Q5604434
@@ Property / cites work: Q5604434 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0004-3702(99)00097-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2057832617
@@ Property / OpenAlex ID: W2057832617 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1978252