activity
20092025
most citedCircuit Complexity and Decompositions of Global Constraints

58 citations · 160 across the 18 of their papers we have counts for

collaborators

21 papers

cs.AI2025

Virtual Arc Consistency for Linear Constraints in Cost Function Networks

Pierre Montalbano, Simon de Givry, George Katsirelos

In Constraint Programming, solving discrete minimization problems with hard and soft constraints can be done either using (i) soft global constraints, (ii) a reformulation into a l…

math.OC2021

Efficient semidefinite bounds for multi-label discrete graphical models

Valentin Durante, George Katsirelos, Thomas Schiex

By concisely representing a joint function of many variables as the combination of small functions, discrete graphical models (GMs) provide a powerful framework to analyze stochast…

cs.AI2021

Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming

Fulya Trösser, Simon de Givry, George Katsirelos

Bayesian networks are probabilistic graphical models with a wide range of application areas including gene regulatory networks inference, risk analysis and image processing. Learni…

cs.AI2020

Partial Queries for Constraint Acquisition

Christian Bessiere, Clement Carbonnel, Anton Dries +8

Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the us…

cs.AI2014★ 6 cited

The Complexity of Integer Bound Propagation

Lucas Bordeaux, George Katsirelos, Nina Narodytska +1

Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a searc…

cs.AI2012★ 3 cited

The SeqBin Constraint Revisited

George Katsirelos, Nina Narodytska, Toby Walsh

We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously propo…