Improved exact solvers for weighted Max-SAT

Authors:
Teresa Alsinet;Felip Manyà;Jordi Planes
Affiliations:
DIEI, Universitat de Lleida, Lleida, Spain;IIIA-CSIC, Bellaterra, Spain;DIEI, Universitat de Lleida, Lleida, Spain
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 3
Cited 15

New upper bounds for maximum satisfiability

Journal of Algorithms
Study of lower bound functions for MAX-2-SAT

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

Resolution for Max-SAT

Artificial Intelligence
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Partial max-SAT solvers with clause learning

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
MiniMaxSAT: a new weighted Max-SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On inconsistent clause-subsets for Max-SAT solving

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Structural relaxations by variable renaming and their compilation for solving MinCostSAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring Max-SAT

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Modelling Max-CSP as partial Max-SAT

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A preprocessor for Max-SAT solvers

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A Max-SAT inference-based pre-processing for Max-clique

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Tracing data errors with view-conditioned causality

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A complete calculus for Max-SAT

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy*) which incorporate original data structures and inference rules, and a lower bound of better quality.