Constraint Reductions

06/03/2020
by   Olivier Bailleux, et al.
0

This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc Consistency (GAC).

READ FULL TEXT

page 1

page 2

page 3

page 4

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
10/10/2019

Reflections on "Incremental Cardinality Constraints for MaxSAT"

To celebrate the first 25 years of the International Conference on Princ...
research
03/31/2018

Efficient Encodings of Conditional Cardinality Constraints

In the encoding of many real-world problems to propositional satisfiabil...
research
01/12/2023

Local consistency as a reduction between constraint satisfaction problems

We study the use of local consistency methods as reductions between cons...
research
01/15/2014

The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and con...
research
03/08/2023

Computational-level Analysis of Constraint Compliance for General Intelligence

Human behavior is conditioned by codes and norms that constrain action. ...
research
05/22/2009

Decompositions of All Different, Global Cardinality and Related Constraints

We show that some common and important global constraints like ALL-DIFFE...

Please sign up or login with your details

Forgot password? Click here to reset