Partitioning methods for satisfiability testing on large formulas (Q1854377): Difference between revisions

@@ Property / DOI @@
-.1006/inco.1999.2860
@@ Property / DOI: 10.1006/inco.1999.2860 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.1999.2860
+Normal rank
@@ Property / OpenAlex ID @@
+W1970590090
@@ Property / OpenAlex ID: W1970590090 / 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 @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for testing the satisfiability of propositional formulae
+Normal rank
@@ Property / cites work @@
+Partitioning methods for satisfiability testing on large formulas
+Normal rank
@@ Property / cites work @@
+Q5687274
@@ Property / cites work: Q5687274 / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/INCO.1999.2860
@@ Property / DOI: 10.1006/INCO.1999.2860 / rank @@
+Normal rank