Incremental Cardinality Constraints for MaxSAT

08/20/2014
by   Ruben Martins, et al.
0

Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental in nature, i.e. at each iteration the formula is rebuilt and no knowledge is reused from one iteration to another. In this paper, we exploit the knowledge acquired across iterations using novel schemes to use cardinality constraints in an incremental fashion. We integrate these schemes with several MaxSAT algorithms. Our experimental results show a significant performance boost for these algo- rithms as compared to their non-incremental counterparts. These results suggest that incremental cardinality constraints could be beneficial for other constraint solving domains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2019

Reflections on "Incremental Cardinality Constraints for MaxSAT"

To celebrate the first 25 years of the International Conference on Princ...
research
06/10/2020

At-Most-One Constraints in Efficient Representations of Mutex Networks

The At-Most-One (AMO) constraint is a special case of cardinality constr...
research
12/17/2010

On the CNF encoding of cardinality constraints and beyond

In this report, we propose a quick survey of the currently known techniq...
research
11/01/2019

CNF Encodings of Cardinality Constraints Based on Comparator Networks

Boolean Satisfiability Problem (SAT) is one of the core problems in comp...
research
03/06/2019

Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)

Many modern-day solvers offer functionality for incremental SAT solving,...
research
03/31/2018

Efficient Encodings of Conditional Cardinality Constraints

In the encoding of many real-world problems to propositional satisfiabil...
research
10/27/2018

A comparison of encodings for cardinality constraints in a SAT solver

Cardinality constraints are important in many Sat problems; previous stu...

Please sign up or login with your details

Forgot password? Click here to reset