Formalization and implementation of modern SAT solvers (Q839035): Difference between revisions

@@ Property / DOI @@
-.1007/s10817-009-9127-8
@@ Property / DOI: 10.1007/s10817-009-9127-8 / rank @@
-Normal rank
@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4473048
@@ Property / cites work: Q4473048 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / 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 @@
+An axiomatic basis for computer programming
@@ Property / cites work: An axiomatic basis for computer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
+Normal rank
@@ Property / cites work @@
+Isabelle/HOL. A proof assistant for higher-order logic
+Normal rank
@@ Property / cites work @@
+Q4413894
@@ Property / cites work: Q4413894 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4804883
@@ Property / cites work: Q4804883 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10817-009-9127-8
@@ Property / DOI: 10.1007/S10817-009-9127-8 / rank @@
+Normal rank