C
Claude-Guy Quimper
Researcher at Laval University
Publications - 107
Citations - 1607
Claude-Guy Quimper is an academic researcher from Laval University. The author has contributed to research in topics: Constraint (information theory) & Constraint programming. The author has an hindex of 21, co-authored 92 publications receiving 1460 citations. Previous affiliations of Claude-Guy Quimper include École Polytechnique de Montréal & University of Waterloo.
Papers
More filters
Book ChapterDOI
Global grammar constraints
Claude-Guy Quimper,Toby Walsh +1 more
TL;DR: This paper considers how to propagate grammar constraints and a number of extensions to specify global constraints via grammars or automata and to propagate this constraint specification efficiently and effectively.
Proceedings Article
A fast and simple algorithm for bounds consistency of the all different constraint
TL;DR: This paper presents a fast, simple algorithm for bounds consistency propagation of the alldifferent constraint and shows that this algorithm outperforms existing bounds consistency algorithms and also outperforms--on problems with an easily identifiable property-state-ofthe-art commercial implementations of propagators for stronger forms of local consistency.
Book ChapterDOI
Decomposing global grammar constraints
Claude-Guy Quimper,Toby Walsh +1 more
TL;DR: Based on an AND/OR decomposition, it is shown that the GRAMMAR constraint can be converted into clauses in conjunctive normal form without hindering propagation and used as an efficient incremental propagator.
Proceedings Article
Constraint acquisition via partial queries
Christian Bessiere,Remi Coletta,Emmanuel Hebrard,George Katsirelos,Nadjib Lazaar,Nina Narodytska,Claude-Guy Quimper,Toby Walsh +7 more
TL;DR: This work provides an algorithm that, given a negative example, focuses onto a constraint of the target network in a number of queries logarithmic in the size of the example.
Journal Article
Improved algorithms for the global cardinality constraint
TL;DR: In this article, the authors study the global cardinality constraint (gcc) and propose an O(n 1.5 d) algorithm for domain consistency and O(cn 2 d + n 2.66 )-time algorithm for range consistency.