Solution Dominance over Constraint Satisfaction Problems

12/21/2018
by   Tias Guns, et al.
0

Constraint Satisfaction Problems (CSPs) typically have many solutions that satisfy all constraints. Often though, some solutions are preferred over others, that is, some solutions dominate other solutions. We present solution dominance as a formal framework to reason about such settings. We define Constraint Dominance Problems (CDPs) as CSPs with a dominance relation, that is, a preorder over the solutions of the CSP. This framework captures many well-known variants of constraint satisfaction, including optimization, multi-objective optimization, Max-CSP, minimal models, minimum correction subsets as well as optimization over CP-nets and arbitrary dominance relations. We extend MiniZinc, a declarative language for modeling CSPs, to CDPs by introducing dominance nogoods; these can be derived from dominance relations in a principled way. A generic method for solving arbitrary CDPs incrementally calls a CSP solver and is compatible with any existing solver that supports MiniZinc. This encourages experimenting with different solution dominance relations for a problem, as well as comparing different solvers without having to modify their implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2015

A Multicore Tool for Constraint Solving

*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (C...
research
09/01/2020

Formally Verified Transformation of Non-binary Constraints into Binary Constraints

It is well known in the Constraint Programming community that any non-bi...
research
01/26/2012

Constraint Propagation as Information Maximization

This paper draws on diverse areas of computer science to develop a unifi...
research
08/30/2011

A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions

In order to give appropriate semantics to qualitative conditionals of th...
research
09/01/2020

PYCSP3: Modeling Combinatorial Constrained Problems in Python

In this document, we introduce PYCSP3, a Python library that allows us t...
research
07/05/2017

Model enumeration in propositional circumscription via unsatisfiable core analysis

Many practical problems are characterized by a preference relation over ...
research
05/25/2021

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization

We build on a recently proposed method for explaining solutions of const...

Please sign up or login with your details

Forgot password? Click here to reset