Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.10.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2025259988
@@ Property / OpenAlex ID: W2025259988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2701980
@@ Property / cites work: Q2701980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4262997
@@ Property / cites work: Q4262997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938415
@@ Property / cites work: Q4938415 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687258
@@ Property / cites work: Q5687258 / 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 @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Short Conjunctive Normal Forms in Finitely Valued Logics
+Normal rank
@@ Property / cites work @@
+Exploiting data dependencies in many-valued logics
+Normal rank
@@ Property / cites work @@
+Local search algorithms for SAT: an empirical evaluation
+Normal rank
@@ Property / cites work @@
+Determining computational complexity from characteristic ‘phase transitions’
+Normal rank
@@ Property / cites work @@
+Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
+Normal rank