Constraint Propagation and Implementation

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[2]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[3]  Frédéric Goualard,et al.  Revising Hull and Box Consistency , 1999, ICLP.

[4]  Eugene Levine,et al.  A Chessboard Coloring Problem , 1989 .

[5]  J. C. Burkill.  Functions of Intervals , 1924 .

[6]  Christian Bessiere,et al.  Theoretical Analysis of Singleton Arc Consistency , 2004 .

[7]  Pascal Van Hentenryck,et al.  Design, Implementation, and Evaluation of the Constraint Language cc(FD) , 1994, Constraint Programming.

[8]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[9]  Roland H. C. Yap,et al.  Making AC-3 an Optimal Algorithm , 2001, IJCAI.

[10]  M. H. van Emden,et al.  Interval arithmetic: From principles to implementation , 2001, JACM.

[11]  Roman Barták,et al.  A New Algorithm for Singleton Arc Consistency , 2004, FLAIRS.

[12]  François Laburhe.  CHOCO: implementing a CP kernel , 2007 .

[13]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[14]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[15]  Nikos Mamoulis,et al.  Solving Non-binary CSPs Using the Hidden Variable Encoding , 2001, CP.

[16]  Marc R. C. van Dongen,et al.  Saving Support-Checks Does Not Always Save Time , 2004, Artificial Intelligence Review.

[17]  Toby Walsh,et al.  Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.

[18]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[19]  Christophe Lecoutre,et al.  Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms , 2003, CP.

[20]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[21]  Richard J. Wallace,et al.  Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.

[22]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[23]  Marc R. C. van Dongen,et al.  AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity , 2002, CP.

[24]  Charles J. Petrie,et al.  On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.

[25]  D. Shmoys,et al.  Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem , 2002 .

[26]  Barbara M. Smith.  A Dual Graph Translation of a Problem in 'Life' , 2002, CP.

[27]  Christian Bessiere,et al.  From Restricted Path Consistency to Max-Restricted Path Consistency , 1997, CP.

[28]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[29]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[30]  Carmen Gervet,et al.  Interval propagation to reason about sets: Definition and implementation of a practical language , 1997, Constraints.

[31]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[32]  Yahia Lebbah,et al.  A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations , 2002, CP.

[33]  Gérard Ferrand,et al.  Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.

[34]  Toby Walsh,et al.  Consistency and Propagation with Multiset Constraints: A Formal Viewpoint , 2003, CP.

[35]  Barbara M. Smith.  Constraint Programming in Practice: Scheduling a Rehearsal , 2003 .

[36]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[37]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[38]  Frédéric Benhamou,et al.  Interval Constraint Logic Programming , 1994, Constraint Programming.

[39]  Hermann Schichl,et al.  Interval Analysis on Directed Acyclic Graphs for Global Optimization , 2005, J. Glob. Optim..

[40]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[41]  Peter van Beek,et al.  Constraint Programming Lessons Learned from Crossword Puzzles , 2001, Canadian Conference on AI.

[42]  Peter van Beek,et al.  On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[43]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[44]  R. B. Kearfott,et al.  Interval Computations: Introduction, Uses, and Resources , 2000 .

[45]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[46]  Pascal Van Hentenryck,et al.  CLP(Intervals) Revisited , 1994, ILPS.

[47]  Lubomir V. Kolev.  Automatic Computation of a Linear Interval Enclosure , 2001, Reliab. Comput..

[48]  Jörg Würtz,et al.  Constructive Disjunction Revisited , 1996, KI.

[49]  Jörg Flum,et al.  Query evaluation via tree-decompositions , 2001, JACM.

[50]  O. Lhomme,et al.  Contribution a la résolution de contraintes sur les réels par propagation d'intervalles , 1994 .

[51]  Nicolas Beldiceanu,et al.  Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type , 2000, CP.

[52]  Boi Faltings,et al.  Arc-Consistency for Continuous Variables , 1994, Artif. Intell..

[53]  De Figueiredo,et al.  Self-validated numerical methods and applications , 1997 .

[54]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[55]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[56]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[57]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[58]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.

[59]  Luc Jaulin,et al.  Applied Interval Analysis , 2001, Springer London.

[60]  Yishai A. Feldman,et al.  Portability by automatic translation: a large-scale case study , 1999 .

[61]  Frédéric Messine,et al.  Extentions of Affine Arithmetic: Application to Unconstrained Global Optimization , 2002, J. Univers. Comput. Sci..

[62]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[63]  M. R. C. van Dongen,et al.  Lightweight MAC Algorithms , 2003, SGAI Conf..

[64]  Toby Walsh,et al.  Singleton Consistencies , 2000, CP.

[65]  Frédéric Goualard,et al.  Box consistency through weak box consistency , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[66]  Pascal Van Hentenryck,et al.  The Cardinality Operator: A New Logical Connective for Constraint Logic Programming , 1990, WCLP.

[67]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[68]  Ralph R. Martin,et al.  Comparison of interval methods for plotting algebraic curves , 2002, Comput. Aided Geom. Des..

[69]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[70]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[71]  Eero Hyvönen,et al.  Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach , 1992, Artif. Intell..