Constraint Networks: Techniques and Algorithms

A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book provides an accessible synthesis of the author's research and work in this area, divided into four main topics: representation, inference, search, and learning. The results obtained and reproduced in this book have a wide applicability, regardless of the nature of the problem or the constraints involved, making it an extremely user-friendly resource for those involved in this field.

[1]  Ke Xu,et al.  A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.

[2]  Berthe Y. Choueiry,et al.  Dynamic Bundling: Less Effort for More Solutions , 2002, SARA.

[3]  Peter van Beek,et al.  Backtracking Search Algorithms , 2006, Handbook of Constraint Programming.

[4]  Ramin Zabih,et al.  Some Applications of Graph Bandwidth to Constraint Satisfaction Problems , 1990, AAAI.

[5]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[6]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[7]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[8]  WERNER BALLMANN.  AUTOMORPHISM GROUPS , 2011 .

[9]  Inês Lynce,et al.  Hidden structure in unsatisfiable random 3-SAT: an empirical study , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[10]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[11]  Toby Walsh,et al.  Domain filtering consistencies for non-binary constraints , 2008, Artif. Intell..

[12]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[13]  Roland H. C. Yap,et al.  Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints , 2008, CP.

[14]  H. Simonis,et al.  Sudoku as a Constraint Problem , 2005 .

[15]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[16]  VersioniDavid G. Mitchell.  Some Random CSPs are Hard for ResolutionhPreliminary , 2000 .

[17]  Eugene C. Freuder,et al.  Tractable Tree Convex Constraint Networks , 2004, AAAI.

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

[19]  Olivier Lhomme,et al.  Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints , 2004, CPAIOR.

[20]  Simon de Givry,et al.  Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques , 2007, Constraints.

[21]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[22]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

[23]  Igor L. Markov,et al.  Solving difficult SAT instances in the presence of symmetry , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[24]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[25]  Lakhdar Sais,et al.  Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.

[26]  Guevara Noubir,et al.  On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[27]  Pascal Van Hentenryck,et al.  Static and Dynamic Structural Symmetry Breaking , 2006, CP.

[28]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[29]  Lakhdar Sais,et al.  About the use of local consistency in solving CSPs , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

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

[31]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[32]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[33]  Steve Linton,et al.  New Developments in Symmetry Breaking in Search Using Computational Group Theory , 2004, AISC.

[34]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

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

[36]  Norman M. Sadeh,et al.  Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..

[37]  Christian Bessiere,et al.  Optimal and Suboptimal Singleton Arc Consistency Algorithms , 2005, IJCAI.

[38]  Alan M. Frieze,et al.  The satisfiability threshold for randomly generated binary constraint satisfaction problems , 2006, RANDOM-APPROX.

[39]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[40]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[41]  William S. Havens,et al.  Detecting Unsatisfiable CSPs by Coloring the Micro-Structure , 1997, AAAI/IAAI.

[42]  Narendra Jussien,et al.  The PaLM system: explanation-based constraint programming , 2000 .

[43]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

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

[45]  Peter J. Stuckey,et al.  Finding all minimal unsatisfiable subsets , 2003, PPDP '03.

[46]  RaphaelBertram,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .

[47]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[48]  Toby Walsh,et al.  Morphing: Combining Structure and Randomness , 1999, AAAI/IAAI.

[49]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[50]  Thanasis Balafoutis,et al.  Exploiting Constraint Weights for Revision Ordering in Arc Consistency Algorithms , 2008 .

[51]  Jean-François Puget.  An Efficient Way of Breaking Value Symmetries , 2006, AAAI.

[52]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[53]  Patrice Boizumault,et al.  k-relevant Explanations for Constraint Programming , 2003, FLAIRS.

[54]  Lakhdar Sais,et al.  Support Inference for Generic Filtering , 2004, CP.

[55]  Hachemi Bennaceur,et al.  A Decomposition Technique for Solving {Max-CSP} , 2008, ECAI 2008.

[56]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[57]  Igor L. Markov,et al.  ShatterPB: symmetry-breaking for pseudo-boolean formulas , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

[58]  Thomas Schiex,et al.  Stubborness: A Possible Enhancement for Backjumping and Nogood Recording , 1994, ECAI.

[59]  David A. Cohen,et al.  Domain permutation reduction for constraint satisfaction problems , 2008, Artif. Intell..

[60]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[61]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[62]  Peter Jeavons,et al.  Symmetry Definitions for Constraint Satisfaction Problems , 2005, Constraints.

[63]  Pascal Van Hentenryck,et al.  Constraint Satisfaction over Connected Row Convex Constraints , 1997, Artif. Intell..

[64]  Christian Bessiere,et al.  Theoretical analysis of singleton arc consistency and its extensions , 2008, Artif. Intell..

[65]  Igor L. Markov,et al.  Efficient symmetry breaking for Boolean satisfiability , 2003, IEEE Transactions on Computers.

[66]  Tad Hogg,et al.  Which Search Problems Are Random? , 1998, AAAI/IAAI.

[67]  F. Verroust,et al.  Solving Partially Symmetrical CSPs , .

[68]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[69]  Thierry Petit,et al.  Reordonnancement de domaines dans les reseaux de contraintes , 2008 .

[70]  Eugene C. Freuder,et al.  Constraint Satisfaction: An Emerging Paradigm , 2006, Handbook of Constraint Programming.

[71]  Christian Bliek,et al.  Generalizing Partial Order and Dynamic Backtracking , 1998, AAAI/IAAI.

[72]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[73]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[74]  Toby Walsh,et al.  The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.

[75]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[76]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[77]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[78]  Andrew B. Baker,et al.  The Hazards of Fancy Backtracking , 1994, AAAI.

[79]  Richard J. Wallace,et al.  Experimental studies of variable selection strategies based on constraint weights , 2008, J. Algorithms.

[80]  Toby Walsh,et al.  Randomness and Structure , 2006, Handbook of Constraint Programming.

[81]  Julian R. Ullmann,et al.  A Binary n-Gram Technique for Automatic Correction of Substitution, Deletion, Insertion and Reversal Errors in Words , 1977, Comput. J..

[82]  Thomas Schiex,et al.  Lazy Arc Consistency , 1996, AAAI/IAAI, Vol. 1.

[83]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

[84]  Hadrien Cambazard,et al.  Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming , 2005, CPAIOR.

[85]  Toby Walsh,et al.  A Compression Algorithm for Large Arity Extensional Constraints , 2007, CP.

[86]  Lakhdar Sais,et al.  Reasoning from last conflict(s) in constraint programming , 2009, Artif. Intell..

[87]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[88]  Roland H. C. Yap,et al.  Consistency and set intersection , 2003, IJCAI.

[89]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.

[90]  David G. Mitchell,et al.  Resolution Complexity of Random Constraints , 2002, CP.

[91]  Pierre Marquis,et al.  Complexity Results for Independence and Definability in Propositional Logic , 1998, KR.

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

[93]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[94]  Peter van Beek,et al.  On the Inherent Level of Local Consistency in Constraint Networks , 1994, AAAI.

[95]  A. Fukunaga.  Complete Restart Strategies Using a Compact Representation of the Explored Search Space , 2007 .

[96]  Willem Jan van Hoeve,et al.  Global Constraints , 2006, Handbook of Constraint Programming.

[97]  Bernard A. Nadel,et al.  Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .

[98]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[99]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[100]  Philippe Jégou,et al.  Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[101]  Barry O'Sullivan,et al.  Automata for Nogood Recording in Constraint Satisfaction Problems , 2006 .

[102]  Steve Linton,et al.  Generic SBDD Using Computational Group Theory , 2003, CP.

[103]  M. R. C. van Dongen,et al.  Two New Lightweight Arc Consistency Algorithms , 2004 .

[104]  Belaid Benhamou,et al.  Study of symmetry in Constraint Satisfaction Problems , 1994 .

[105]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction a More Accurate Picture , 2022 .

[106]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[107]  Philippe Jégou,et al.  (No)good Recording and ROBDDs for Solving Structured (V)CSPs , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[108]  Eugene C. Freuder,et al.  Interchangeability Preprocessing Can Improve Forward Checking Search , 1992, ECAI.

[109]  Roland H. C. Yap,et al.  Maintaining Generalized Arc Consistency on Ad-Hoc n-Ary Boolean Constraints , 2006, ECAI.

[110]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[111]  Kostas Stergiou,et al.  Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results , 2005, J. Artif. Intell. Res..

[112]  Kostas Stergiou,et al.  On Conflict-driven variable ordering heuristics , 2008 .

[113]  Joao Marques-Silva,et al.  Complete Search Restart Strategies for Satisfiability , 2001 .

[114]  Christophe Lecoutre,et al.  Path Consistency by Dual Consistency , 2007, CP.

[115]  Toby Walsh,et al.  Global Constraints for Lexicographic Orderings , 2002, CP.

[116]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[117]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[118]  Rina Dechter,et al.  Backjump-based backtracking for constraint satisfaction problems , 2002, Artif. Intell..

[119]  Narendra Jussien,et al.  Évaluer la difficulté d'une grille de sudoku à l'aide d'un modèle contraintes , 2006 .

[120]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[121]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[122]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics , 1983, Artif. Intell..

[123]  Paul Walton Purdom,et al.  Backtrack Searching in the Presence of Symmetry , 1988, Nord. J. Comput..

[124]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[125]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[126]  Barry O'Sullivan,et al.  The Impact of Search Heuristics on Heavy-Tailed Behaviour , 2006, Constraints.

[127]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

[128]  Boi Faltings,et al.  Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems , 2003, CP.

[129]  Patrick Prosser,et al.  Maintaining Singleton Arc-Consistency , 2006 .

[130]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[131]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[132]  Ian P. Gent,et al.  Watched Literals for Constraint Propagation in Minion , 2006, CP.

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

[134]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

[135]  Barbara M. Smith,et al.  Value Ordering for Finding All Solutions , 2005, IJCAI.

[136]  Warwick Harvey.  Symmetry Breaking and the Social Golfer Problem , 2001 .

[137]  James Mackenzie Crawford.  A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract) , 1992 .

[138]  Lakhdar Sais,et al.  Nogood Recording from Restarts , 2007, IJCAI.

[139]  Philippe Jégou,et al.  A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

[140]  Abdul Sattar,et al.  Building Structure into Local Search for SAT , 2007, IJCAI.

[141]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[142]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[143]  François Pachet,et al.  Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems , 2002 .

[144]  Amnon Meisels,et al.  A CSP Search Algorithm with Responsibility Sets and Kernels , 2007, Constraints.

[145]  Christophe Lecoutre,et al.  Conservative Dual Consistency , 2007, AAAI.

[146]  Berthe Y. Choueiry,et al.  Abstraction by Interchangeability in Resource Allocation , 1995, IJCAI.

[147]  Boi Faltings,et al.  Applying interchangeability techniques to the distributed breakout algorithm , 2003, IJCAI.

[148]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[149]  Christian Bessiere,et al.  Using Constraint Metaknowledge to Reduce Arc Consistency Computation , 1999, Artif. Intell..

[150]  Carme Torras,et al.  Exploiting symmetries within constraint satisfaction search , 2001, Artif. Intell..

[151]  William S. Havens,et al.  An empirical study of probabilistic arc consistency as a variable ordering heuristic , 2000 .

[152]  Warwick Harvey,et al.  Groups and Constraints: Symmetry Breaking during Search , 2002, CP.

[153]  Martin C. Cooper,et al.  Hybrid tractable CSPs which generalize tree structure , 2008, ECAI.

[154]  Julian R. Ullmann.  Parallel recognition of idealised line characters , 2004, Kybernetik.

[155]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.

[156]  Lakhdar Sais,et al.  Boosting complete techniques thanks to local search methods , 1998, Annals of Mathematics and Artificial Intelligence.

[157]  Amnon Meisels,et al.  Maintaining Dominance Consistency , 2003, CP.

[158]  Christophe Lecoutre.  Constraint Networks , 1992 .

[159]  Narendra Jussien,et al.  A to Z of Sudoku , 2007 .

[160]  Carlos Ansótegui,et al.  Edge Matching Puzzles as Hard SAT/CSP Benchmarks , 2008, CP.

[161]  Eric Horvitz,et al.  The Backdoor Key: A Path to Understanding Problem Hardness , 2004, AAAI.

[162]  Barry O'Sullivan,et al.  Failure Analysis in Backtrack Search for Constraint Satisfaction , 2006, CP.

[163]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[164]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[165]  Marc Gyssens,et al.  A Unifying Framework for Tractable Constraints , 1995, CP.

[166]  R. Lathe.  Phd by thesis , 1988, Nature.

[167]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[168]  Jean-Charles Régin,et al.  A Fast Arc Consistency Algorithm for n-ary Constraints , 2005, AAAI.

[169]  Pedro Barahona,et al.  On the Integration of Singleton Consistencies and Look-Ahead Heuristics , 2008, CSCLP.

[170]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

[171]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[172]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[173]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[174]  R E Kalman,et al.  Not all (possibly) "random" sequences are created equal. , 1997, Proceedings of the National Academy of Sciences of the United States of America.

[175]  David Zuckerman,et al.  Optimal Speedup of Las Vegas Algorithms , 1993, Inf. Process. Lett..

[176]  Kostas Stergiou.  Heuristics for Dynamically Adapting Propagation , 2008, ECAI.

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

[178]  Maurice Bruynooghe,et al.  Solving Combinatorial Search Problems by Intelligent Backtracking , 1981, Inf. Process. Lett..

[179]  Peter van Beek,et al.  Local and Global Relational Consistency , 1995, Theor. Comput. Sci..

[180]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[181]  Yong Gao,et al.  Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness , 2004, CP.

[182]  Toni Mancini,et al.  Exploiting functional dependencies in declarative problem specifications , 2004, Artif. Intell..

[183]  J. Christopher Beck,et al.  Variable Ordering Heuristics Show Promise , 2004, CP.

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

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

[186]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

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

[188]  Richard J. Wallace,et al.  Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[189]  Martin C. Cooper.  Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems , 1997, Artif. Intell..

[190]  Jean-François Puget,et al.  Automatic Detection of Variable and Value Symmetries , 2005, CP.

[191]  Eric Monfroy,et al.  Improved bounds on the complexity of kB-consistency , 2001, IJCAI.

[192]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[193]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

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

[195]  Barbara M. Smith.  The Brélaz Heuristic and Optimal Static Orderings , 1999, CP.

[196]  Julian R. Ullmann,et al.  Partition search for non-binary constraint satisfaction , 2007, Inf. Sci..

[197]  Peter van Beek,et al.  Constraint tightness and looseness versus local and global consistency , 1997, JACM.

[198]  Éric Grégoire,et al.  Extracting MUSes , 2006, ECAI.

[199]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[200]  Toni Mancini,et al.  A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability , 2008, J. Artif. Intell. Res..

[201]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[202]  James Bowen,et al.  Arc Consistency during Search , 2007, IJCAI.

[203]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

[204]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[205]  Djamila Sam-Haroud,et al.  Path Consistency on Triangulated Constraint Graphs , 1999, IJCAI.

[206]  Eugene C. Freuder,et al.  Arc Consistency in MAC: A New Perspective? , 2004 .

[207]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[208]  Toby Walsh,et al.  Breaking Symmetry of Interchangeable Variables and Values , 2007, CP.

[209]  Nageshwara Rao Vempaty.  Solving Constraint Satisfaction Problems Using Finite State Automata , 1992, AAAI.

[210]  Romuald Debruyne,et al.  A strong local consistency for constraint satisfaction , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

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

[212]  Abdul Sattar,et al.  Extending Dual Arc Consistency , 2002, Int. J. Pattern Recognit. Artif. Intell..

[213]  Toby Walsh,et al.  Backbones and Backdoors in Satisfiability , 2005, AAAI.

[214]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[215]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[216]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

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

[218]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

[219]  Eugene C. Freuder,et al.  Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.

[220]  Shie-Jue Lee,et al.  Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[221]  Igor L. Markov,et al.  Automatically Exploiting Symmetries in Constraint Programming , 2004, CSCLP.

[222]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[223]  Fahiem Bacchus,et al.  Unrestricted Nogood Recording in CSP Search , 2003, CP.

[224]  Rina Dechter,et al.  Advances in AND / OR Branch-and-Bound Search for Constraint Optimization , 2005 .

[225]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[226]  Ian P. Gent,et al.  Data Structures for Generalised Arc Consistency for Extensional Constraints , 2007, AAAI.

[227]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

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

[229]  David G. Mitchell,et al.  2-Way vs. d-Way Branching for CSP , 2005, CP.

[230]  Christophe Lecoutre,et al.  Generalized Arc Consistency for Positive Table Constraints , 2006, CP.

[231]  Toby Walsh,et al.  Propagation algorithms for lexicographic ordering constraints , 2006, Artif. Intell..

[232]  Robin J. Wilson.  Four Colors Suffice: How the Map Problem Was Solved , 2002 .

[233]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

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

[235]  Rolf Backofen,et al.  Excluding Symmetries in Constraint-Based Search , 1999, CP.

[236]  Luís Moniz Pereira,et al.  Deduction Revision by Intelligent Backtracking , 1984, Implementations of Prolog.

[237]  Cnrs Fre,et al.  Enforcing Arc Consistency using Bitwise Operations , 2007 .

[238]  Jean-François Puget,et al.  Symmetry Breaking Revisited , 2002, Constraints.

[239]  N. J.L.deSiqueira,et al.  Explanation-Based Generalisation of Failures , 1988, ECAI.

[240]  Christophe Lecoutre.  Optimization of Simple Tabular Reduction for Table Constraints , 2008, CP.

[241]  Vincent Vidal,et al.  A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.

[242]  Rina Dechter,et al.  Look-Ahead Value Ordering for Constraint Satisfaction Problems , 1995, IJCAI.

[243]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[244]  Igor L. Markov,et al.  AMUSE: a minimally-unsatisfiable subformula extractor , 2004, Proceedings. 41st Design Automation Conference, 2004..

[245]  Philippe Jégou,et al.  A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation , 1989, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence.

[246]  Barry O'Sullivan,et al.  Guiding Search Using Constraint-Level Advice , 2006, ECAI.

[247]  Holger H. Hoos,et al.  Local Search Methods , 2006, Handbook of Constraint Programming.

[248]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[249]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[250]  Christopher Mears,et al.  On implementing symmetry detection , 2009, Constraints.

[251]  Fahiem Bacchus,et al.  Extending Forward Checking , 2000, CP.

[252]  Marc R. C. van Dongen.  Beyond Singleton Arc Consistency , 2006, ECAI.

[253]  Richard J. Wallace,et al.  Learning to Identify Global Bottlenecks in Constraint Satisfaction Search , 2007, FLAIRS.

[254]  Eugene C. Freuder,et al.  Properties of tree convex constraints , 2008, Artif. Intell..

[255]  Mugur M. Tatar,et al.  Computing Minimal Conflicts for Rich Constraint Languages , 2002, ECAI.

[256]  Christophe Lecoutre,et al.  A Greedy Approach to Establish Singleton Arc Consistency , 2005, IJCAI.

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

[258]  Christian Bessiere,et al.  Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.

[259]  Barbara M. Smith,et al.  Constructing an asymptotic phase transition in random binary constraint satisfaction problems , 2001, Theor. Comput. Sci..

[260]  Christian Schulte.  Comparing Trailing and Copying for Constraint Programming , 1999, ICLP.

[261]  Christophe Lecoutre,et al.  Backjump-based techniques versus conflict-directed heuristics , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[262]  Tarik Hadzic,et al.  On Automata , MDDs and BDDs in Constraint Satisfaction , 2008 .

[263]  Nathan Goodman,et al.  Syntactic Characterization of Tree Database Schemas , 1983, JACM.

[264]  Christian Bessiere,et al.  A Generic Customizable Framework for Inverse Local Consistency , 1999, AAAI/IAAI.

[265]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[266]  Martin Henz,et al.  Components for State Restoration in Tree Search , 2001, CP.

[267]  Tad Hogg,et al.  Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..

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

[269]  Fahiem Bacchus,et al.  Generalized NoGoods in CSPs , 2005, AAAI.

[270]  Linda Torczon,et al.  An efficient representation for sparse sets , 1993, LOPL.

[271]  Toby Walsh,et al.  Inverse Consistencies for Non-Binary Constraints , 2006, ECAI.

[272]  Simon de Givry,et al.  Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP , 2006, AAAI.

[273]  Bart Selman,et al.  Generating Satisfiable Problem Instances , 2000, AAAI/IAAI.

[274]  Marko Samer,et al.  Backdoor Trees , 2008, AAAI.

[275]  Ian P. Gent,et al.  Symmetry in Constraint Programming , 2006, Handbook of Constraint Programming.

[276]  Julian R. Ullmann,et al.  Associating Parts of Patterns , 1966, Inf. Control..

[277]  Berthe Y. Choueiry,et al.  Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs , 2005, AAAI.

[278]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[279]  Patrick Prosser,et al.  MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .

[280]  Deepak Mehta,et al.  Reducing Checks and Revisions in Coarse-grained MAC Algorithms , 2005, IJCAI.

[281]  Roland H. C. Yap,et al.  Maintaining Arc Consistency with Multiple Residues , 2008 .

[282]  Christian Bessiere,et al.  A General Conflict-Set Based Framework for Partial Constraint Satisfaction , 2008 .

[283]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[284]  Toby Walsh,et al.  CGRASS: A System for Transforming Constraint Satisfaction Problems , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[285]  R. H. C. Yap,et al.  Set Intersection and Consistency in Constraint Networks , 2006, J. Artif. Intell. Res..

[286]  Tony Marsland,et al.  COMPUTER CHESS AND SEARCH , 1992 .

[287]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[288]  Lakhdar Sais,et al.  Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance , 2007, CP.

[289]  Philippe Jégou,et al.  On a generalization of triangulated graphs for domains decomposition of CSPs , 2003, IJCAI.

[290]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[291]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[292]  David G. Mitchell.  Resolution and Constraint Satisfaction , 2003, CP.

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

[294]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[295]  Michael Molloy,et al.  Models for Random Constraint Satisfaction Problems , 2003, SIAM J. Comput..

[296]  Christian Bessiere,et al.  Statistical Regimes Across Constrainedness Regions , 2004, Constraints.

[297]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[298]  Éric Grégoire,et al.  MUST: Provide a Finer-Grained Explanation of Unsatisfiability , 2007, CP.

[299]  Hantao Zhang.  A Random Jump Strategy for Combinatorial Search , 2001 .

[300]  Willem Jan van Hoeve,et al.  Postponing Branching Decisions , 2004, ECAI.

[301]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 2001, JACM.

[302]  Philippe Jégou,et al.  Efficient Path-Consistency Propagation , 1998, Int. J. Artif. Intell. Tools.

[303]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

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

[305]  Christian Bessiere,et al.  Apprentissage de Contraintes Globales Implicites , 2005 .

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

[307]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .

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

[309]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[310]  Lakhdar Sais,et al.  Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem , 2001, CP.

[311]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[312]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[313]  Berthe Y. Choueiry,et al.  How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search , 2001, Australian Joint Conference on Artificial Intelligence.

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

[315]  Stefan Szeider,et al.  Backdoor Sets for DLL Subsolvers , 2005, Journal of Automated Reasoning.

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

[317]  Lakhdar Sais,et al.  Transposition Tables for Constraint Satisfaction , 2007, AAAI.

[318]  Kostas Stergiou.  Strong Inverse Consistencies for Non-Binary CSPs , 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

[319]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[320]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[321]  Moninder Singh.  Path Consistency Revisited , 1996, Int. J. Artif. Intell. Tools.

[322]  Belaid Benhamou,et al.  Local Symmetry Breaking During Search in CSPs , 2007, CP.

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

[324]  Lefteris M. Kirousis,et al.  Fast Parallel Constraint Satisfaction , 1993, Artif. Intell..

[325]  Eugene C. Freuder,et al.  Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction , 1997, AAAI/IAAI.

[326]  Michael C. Frank,et al.  Search Lessons Learned from Crossword Puzzles , 1990, AAAI.

[327]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[328]  Lakhdar Sais,et al.  Extracting MUCs from Constraint Networks , 2006, ECAI.

[329]  Eugene C. Freuder,et al.  Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems , 1993, IJCAI.

[330]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[331]  Gilles Pesant,et al.  A Filtering Algorithm for the Stretch Constraint , 2001, CP.

[332]  Bertrand Neveu,et al.  Progressive Focusing Search , 2002, ECAI.

[333]  Olivier Lhomme,et al.  Quick Shaving , 2005, AAAI.

[334]  Pascal Van Hentenryck,et al.  Structural Symmetry Breaking , 2005, IJCAI.

[335]  Toby Walsh,et al.  General Symmetry Breaking Constraints , 2006, CP.

[336]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[337]  Toby Walsh,et al.  Breaking Row and Column Symmetries in Matrix Models , 2002, CP.

[338]  J. J. McGregor.  Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

[339]  Christophe Lecoutre,et al.  Constraint-Level Advice for Shaving , 2008, ICLP.

[340]  Mats Carlsson,et al.  Finite Domain Constraint Programming Systems , 2006, Handbook of Constraint Programming.

[341]  Philippe Jégou,et al.  Decomposition and Good Recording for Solving Max-CSPs , 2004, ECAI.

[342]  Lakhdar Sais,et al.  Recording and Minimizing Nogoods from Restarts , 2007, J. Satisf. Boolean Model. Comput..

[343]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[344]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[345]  P. M. Wognum,et al.  Diagnosing and Solving Over-Determined Constraint Satisfaction Problems , 1993, IJCAI.

[346]  Olivier Roussel,et al.  XML Representation of Constraint Networks: Format XCSP 2.1 , 2009, ArXiv.

[347]  Pascal Van Hentenryck,et al.  Compositional Derivation of Symmetries for Constraint Satisfaction , 2005, SARA.

[348]  Inês Lynce,et al.  On Computing Minimum Unsatisfiable Cores , 2004, SAT.

[349]  Eugene C. Freuder,et al.  Ordering Heuristics for Arc Consistency Algorithms , 1992 .

[350]  Adi Botea,et al.  Crossword Puzzles as a Constraint Problem , 2008, CP.

[351]  Barry O'Sullivan,et al.  Reformulating Positive Table Constraints Using Functional Dependencies , 2008, CP.

[352]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[353]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[355]  Eduard L. Köhler,et al.  Erratum to: P , 1955 .

[356]  Vibhav Gogate,et al.  Counting-Based Look-Ahead Schemes for Constraint Satisfaction , 2004, CP.

[357]  Donald E. Eastlake,et al.  The Greenblatt chess program , 1967, AFIPS '67 (Fall).

[358]  Peter van Beek,et al.  Conflict-Directed Backjumping Revisited , 2011, J. Artif. Intell. Res..

[359]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[360]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[361]  Peter van Beek,et al.  Constraint Tightness versus Global Consistency , 1994, KR.

[362]  Lakhdar Sais,et al.  Using SAT Encodings to Drive CSP Value Ordering Heuristics , 2007, J. Satisf. Boolean Model. Comput..

[363]  Deepak Mehta,et al.  Probabilistic Consistency Boosts MAC and SAC , 2007, IJCAI.

[364]  Christophe Lecoutre,et al.  A Study of Residual Supports in Arc Consistency , 2007, IJCAI.

[365]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.