Berthe Y. Choueiry
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Berthe Y. Choueiry has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Anthony Schneider
University of Nebraska-Lincoln
2 shared publications Bob Givan
Purdue University
1 shared publication- Christian Bessiere
CNRS, University of Montpellier, France
1 shared publication - Eugene C. Freuder
University College Cork
1 shared publication Robert J. Woodward
Constraint Systems Laboratory, University of Nebraska-Lincoln, USA
1 shared publication- Robert J. Woodward
University of Nebraska–Lincoln , Department of Computer Science & Engineering , Lincoln NE 68588-0115 , USA
1 shared publication
Latest Publications
- 22 September 2018
- Published by Springer Nature
- p. E1
Correction to: PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints
- 22 September 2018
- Published by Springer Nature
- p. E1
Correction to: PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints
- 23 August 2018
- Published by Springer Nature
- p. 345-361
PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints
- 23 August 2018
- Published by Springer Nature
- p. 345-361
PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 1390-1397
A Reactive Strategy for High-Level Consistency During Search
Constraint propagation during backtrack search significantly improves the performance of solving a Constraint Satisfaction Problem. While Generalized Arc Consistency (GAC) is the most popular level of propagation, higher-level consistencies (HLC) are needed to solve difficult instances. Deciding to enforce an HLC instead of GAC remains the topic of active research. We propose a simple and effective strategy that reactively triggers an HLC by monitoring search performance: When search starts thrashing, we trigger an HLC, then conservatively revert to GAC. We detect thrashing by counting the number of backtracks at each level of the search tree and geometrically adjust the frequency of triggering an HLC based on its filtering effectiveness. We validate our approach on benchmark problems using Partition-One Arc-Consistency as an HLC. However, our strategy is generic and can be used with other higher-level consistency algorithms.
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 1390-1397
A Reactive Strategy for High-Level Consistency During Search
Constraint propagation during backtrack search significantly improves the performance of solving a Constraint Satisfaction Problem. While Generalized Arc Consistency (GAC) is the most popular level of propagation, higher-level consistencies (HLC) are needed to solve difficult instances. Deciding to enforce an HLC instead of GAC remains the topic of active research. We propose a simple and effective strategy that reactively triggers an HLC by monitoring search performance: When search starts thrashing, we trigger an HLC, then conservatively revert to GAC. We detect thrashing by counting the number of backtracks at each level of the search tree and geometrically adjust the frequency of triggering an HLC based on its filtering effectiveness. We validate our approach on benchmark problems using Partition-One Arc-Consistency as an HLC. However, our strategy is generic and can be used with other higher-level consistency algorithms.
- Open Access
A Partial Taxonomy of Substitutability and Interchangeability
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the different concepts, and indicate directions for future work, in particular with respect to making connections with research into symmetry breaking. This paper is a condensed version of a larger work in progress.
Open AccessA Partial Taxonomy of Substitutability and Interchangeability
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the different concepts, and indicate directions for future work, in particular with respect to making connections with research into symmetry breaking. This paper is a condensed version of a larger work in progress.
- 1 April 2010
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 58 (3-4) , 153
Preface
- 1 April 2010
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 58 (3-4) , 153
Preface
- 1 February 2005
- Published by Elsevier in Artificial Intelligence
- Vol. 162 (1-2) , 145-204
Towards a practical theory of reformulation for reasoning about physical systems
- 1 February 2005
- Published by Elsevier in Artificial Intelligence
- Vol. 162 (1-2) , 145-204
Towards a practical theory of reformulation for reasoning about physical systems