8 citations · 10 across the 5 of their papers we have counts for
5 papers
Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain variables
Dimitri Justeau-Allaire, Philippe Birnbaum, Xavier Lorca
Graph domain variables and constraints are an extension of constraint programming introduced by Dooms et al. This approach had been further investigated by Fages in its PhD thesis.…
Event Selection Rules to Compute Explanations
Charles Prud'homme, Xavier Lorca, Narendra Jussien
Explanations have been introduced in the previous century. Their interest in reducing the search space is no longer questioned. Yet, their efficient implementation into CSP solver…
A Probabilistic-Based Model for Binary CSP
Amine Balafrej, Xavier Lorca, Charlotte Truchet
This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in…
Improving the Asymmetric TSP by Considering Graph Structure
Jean-Guillaume Fages, Xavier Lorca
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric…
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction
Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving general- ized arc-consistency according to some properties. SEQ BIN can be used for encoding c…