Reflections on "Incremental Cardinality Constraints for MaxSAT"

10/10/2019
by   Ruben Martins, et al.
0

To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of each year to write a commentary on their paper. This report describes our reflections on the CP 2014 paper "Incremental Cardinality Constraints for MaxSAT" and its impact on the Maximum Satisfiability community and beyond.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2014

Incremental Cardinality Constraints for MaxSAT

Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolea...
research
06/03/2020

Constraint Reductions

This is a commentary on the CP 2003 paper "Efficient cnf encoding of boo...
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
02/05/2021

Exact Optimization of Conformal Predictors via Incremental and Decremental Learning

Conformal Predictors (CP) are wrappers around ML methods, providing erro...
research
08/11/2021

Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods

We study a variation of the Stable Marriage problem, where every man and...
research
04/05/2016

An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming

The main advantage of Constraint Programming (CP) approaches for sequent...

Please sign up or login with your details

Forgot password? Click here to reset