
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
Bayesian networks are probabilistic graphical models with a wide range o...
read it

Partial Queries for Constraint Acquisition
Learning constraint networks is known to require a number of membership ...
read it

The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used...
read it

The SeqBin Constraint Revisited
We revisit the SeqBin constraint. This metaconstraint subsumes a number...
read it

Complexity of and Algorithms for Borda Manipulation
We prove that it is NPhard for a coalition of two manipulators to compu...
read it

Symmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show th...
read it

Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two AllDifferent ...
read it

Breaking Generator Symmetry
Dealing with large numbers of symmetries is often problematic. One solut...
read it

The Weighted CFG Constraint
We introduce the weighted CFG constraint and propose a propagation algor...
read it

Decomposition of the NVALUE constraint
We study decompositions of NVALUE, a global constraint that can be used ...
read it

Restricted Global Grammar Constraints
We investigate the global GRAMMAR constraint over restricted classes of ...
read it

Circuit Complexity and Decompositions of Global Constraints
We show that tools from circuit complexity can be used to study decompos...
read it

Decompositions of All Different, Global Cardinality and Related Constraints
We show that some common and important global constraints like ALLDIFFE...
read it
George Katsirelos
is this you? claim profile
Researcher at the SaAB team of the MIAT unit at INRA, Toulouse, Member of the COMIC multisite research group.