research
∙
11/24/2021
Efficient semidefinite bounds for multi-label discrete graphical models
By concisely representing a joint function of many variables as the comb...
share
research
∙
06/23/2021
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
Bayesian networks are probabilistic graphical models with a wide range o...
research
∙
03/14/2020
Partial Queries for Constraint Acquisition
Learning constraint networks is known to require a number of membership ...
research
∙
01/16/2014
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used...
research
∙
07/07/2012
The SeqBin Constraint Revisited
We revisit the SeqBin constraint. This meta-constraint subsumes a number...
research
∙
05/27/2011
Complexity of and Algorithms for Borda Manipulation
We prove that it is NP-hard for a coalition of two manipulators to compu...
research
∙
05/28/2010
Symmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show th...
research
∙
04/15/2010
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two AllDifferent ...
research
∙
09/28/2009
Breaking Generator Symmetry
Dealing with large numbers of symmetries is often problematic. One solut...
research
∙
09/24/2009
The Weighted CFG Constraint
We introduce the weighted CFG constraint and propose a propagation algor...
research
∙
09/17/2009
Decomposition of the NVALUE constraint
We study decompositions of NVALUE, a global constraint that can be used ...
research
∙
06/29/2009
Restricted Global Grammar Constraints
We investigate the global GRAMMAR constraint over restricted classes of ...
research
∙
05/22/2009
Circuit Complexity and Decompositions of Global Constraints
We show that tools from circuit complexity can be used to study decompos...
research
∙
05/22/2009
