Solving Max-SAT as weighted CSP

DOI10.1007/B13743MaRDI QIDQ5897208zbMATH OpenOpenAlexFDO

Authors Simon de Givry, Javier Larrosa, Thomas Schiex, P. Meseguer

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A logical approach to efficient Max-SAT solving
• Minimaxsat: an efficient weighted Max-SAT solver
• Exact Max-SAT solvers for over-constrained problems
• Principles and Practice of Constraint Programming – CP 2004
• Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT

Cited in

(39)

• Clique inference process for solving Max-CSP
• Incomplete inference for graph problems
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
• A proof builder for Max-SAT
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• Iterative and core-guided maxsat solving: a survey and assessment
• A logical approach to efficient Max-SAT solving
• A taxonomy of exact methods for partial Max-SAT
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Exact MAX-2SAT solution via lift-and-project closure
• Exact Max-SAT solvers for over-constrained problems
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• scientific article; zbMATH DE number 5996844 (Why is no real title available?)
• Solving #SAT and MAXSAT by Dynamic Programming
• Modelling Max-CSP as Partial Max-SAT
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Solving weighted Max-SAT problems in a reduced search space: a performance analysis
• 2006 and 2007 Max-SAT evaluations: contributed instances
• Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
• scientific article; zbMATH DE number 1114005 (Why is no real title available?)
• MaxSAT-based encodings for Group MaxSAT
• Reformulation based MaxSat robustness
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Solving maximum weight clique using maximum satisfiability reasoning
• Exploiting the power of MIP solvers in MAXSAT
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Theory and Applications of Satisfiability Testing
• Solving satisfiability problems with preferences
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• Improving exact algorithms for MAX-2-SAT
• Arc consistency for soft constraints
• Scatter search and genetic algorithms for MAX-SAT problems
• Combining VNS with constraint programming for solving anytime optimization problems
• An efficient solver for weighted Max-SAT
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• A branch and bound algorithm for numerical Max-CSP

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Solving Max-SAT as weighted CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897208)