Network-based heuristics for constraint satisfaction problems

Many AI tasks can be formulated as Constraint-Satisfaction problems (CSP), i.e., the assignment of values to variables subject to a set of constraints. While some CSPs are hard, those that are easy can often be mapped into sparse networks of constraints which, in the extreme case, are trees. This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally. The paper then presents a method of generating heuristic advice to guide the order of value assignments based on both the sparseness found in the constraint network and the simplicity of tree-structured CSPs. The advice is generated by simplifying the pending subproblems into trees, counting the number of consistent solutions in each simplified subproblem, and comparing these counts to decide among the choices pending in the original problem.

[1]  John Gaschnig,et al.  A Problem Similarity Approach to Devising Heuristics: First Results , 1979, IJCAI.

[2]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[3]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

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

[5]  J. Carbonell.  Learning by Analogy: Formulating and Generalizing Plans from Past Experience , 1983 .

[6]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[7]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .

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

[9]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

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

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

[12]  Giovanni Guida,et al.  A Method for Computing Heuristics in Problem-Solving , 1978, AISB/GI.

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

[14]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[15]  Judea Pearl.  On the Discovery and Generation of Certain Heuristics , 1983, AI Mag..

[16]  Harold S. Stone,et al.  The Average Complexity of Depth-First Search with Backtracking and Cutoff , 1986, IBM J. Res. Dev..

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

[18]  Philip T. Cox,et al.  Finding Backtrack Points for Intelligent Backtracking , 1984, Implementations of Prolog.

[19]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[20]  Rina Dechter,et al.  The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation , 1985, IJCAI.

[21]  Stan Matwin,et al.  Intelligent Backtracking in Plan-Based Deduction , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

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

[25]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[26]  Shimon Even,et al.  Graph Algorithms , 1979 .

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

[28]  ArnborgStefan.  Efficient algorithms for combinatorial problems on graphs with bounded, decomposabilitya survey , 1985 .

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