Modelling Max-CSP as Partial Max-SAT (Q3502687): Difference between revisions

@@ Property / OpenAlex ID @@
+W1847027834
@@ Property / OpenAlex ID: W1847027834 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Max-SAT solvers for over-constrained problems
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A Complete Calculus for Max-SAT
@@ Property / cites work: A Complete Calculus for Max-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+On Solving the Partial MAX-SAT Problem
@@ Property / cites work: On Solving the Partial MAX-SAT Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Log-Support Encoding of CSP into SAT
@@ Property / cites work: The Log-Support Encoding of CSP into SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624109
@@ Property / cites work: Q3624109 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parallel complexity of discrete relaxation in constraint satisfaction networks
+Normal rank
@@ Property / cites work @@
+A logical approach to efficient Max-SAT solving
@@ Property / cites work: A logical approach to efficient Max-SAT solving / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
+Normal rank
@@ Property / cites work @@
+Q5435834
@@ Property / cites work: Q5435834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4473043
@@ Property / cites work: Q4473043 / rank @@
+Normal rank