Network-based heuristics for constraint-satisfaction problems

Arnborg, 1985, Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey, BIT, 25, 2, 10.1007/BF01934985 Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8, 177, 10.1137/0608024 Bertele, 1972 Bruynooghe, 1984, Deduction revision by intelligent backtracking, 194 Carbonell, 1983, Learning by analogy: Formulation and generating plan from past experience Cox, 1984, Finding backtrack points for intelligent backtracking, 216 Dechter, 1987, Removing redundancies in constraint networks Dechter, 1987, A problem simplification approach that generates heuristics for constraint satisfaction problems, 11 Dechter, 1985, The anatomy of easy problems: A constraint-satisfaction formulation, 1066 Dechter, 1986, Learning while searching in constraint-satisfaction problems Dechter, 1987, A tree-clustering scheme for CSPs Dechter, 1987, The cycle-cutset method for improving search performance in AI applications, 224 Doyle, 1979, A truth maintenance system, Artificial Intelligence, 12, 231, 10.1016/0004-3702(79)90008-0 Even, 1979 Freuder, 1982, A sufficient condition of backtrack-free search, J. ACM, 29, 24, 10.1145/322290.322292 Freuder, 1985, A sufficient condition for backtrack-bounded search, J. ACM, 32, 755, 10.1145/4221.4225 Gashnig, 1979, Performance measurement and analysis of certain search algorithms Gaschnig, 1979, A problem similarity approach to devising heuristics: First results, 301 Guida, 1979, A method for computing heuristics in problem solving, Inf. Sci., 19, 251, 10.1016/0020-0255(79)90024-0 Haralick, 1980, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, 14, 263, 10.1016/0004-3702(80)90051-X Knuth, 1975, Estimating the efficiency of backtrack programs, Math. Comput., 29, 121, 10.2307/2005469 Mackworth, 1977, Consistency in networks of relations, Artificial Intelligence, 8, 99, 10.1016/0004-3702(77)90007-8 Mackworth, 1984, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, 25, 65, 10.1016/0004-3702(85)90041-4 Martins, 1986, Theoretical foundations for belief revision, 383 Matwin, 1985, Intelligent backtracking in plan-based deduction, IEEE Trans. Pattern Anal. Machine Intell., 7, 682, 10.1109/TPAMI.1985.4767724 Minsky, 1963, Steps towards Artificial Intelligence, 442 Mohr, 1986, Arc and path consistency revisited, Artificial Intelligence, 28, 225, 10.1016/0004-3702(86)90083-4 Montanari, 1974, Networks of constraints: Fundamental properties and applications to picture processing, Inf. Sci., 7, 95, 10.1016/0020-0255(74)90008-5 Nudel, 1983, Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics, Artificial Intelligence, 21, 135, 10.1016/S0004-3702(83)80008-3 Pearl, 1983, On the discovery and generation of certain heuristics, AI Mag., 22–23 1984, 113 Purdom, 1983, Search rearrangement backtracking and polynomial average time, Artificial Intelligence, 21, 117, 10.1016/S0004-3702(83)80007-1 Purdom, 1985 Sacerdoti, 1974, Planning in a hierarchy of abstraction spaces, Artificial Intelligence, 5, 115, 10.1016/0004-3702(74)90026-5 Stallman, 1977, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, Artificial Intelligence, 9, 135, 10.1016/0004-3702(77)90029-7 Stone, 1986, Efficient search techniques: An empirical study of the N-queens problem Stone, 1986, The average complexity of depth-first search with backtracking and cut-off, IBM J. Res. Dev., 30, 242, 10.1147/rd.303.0242 Tarjan, 1984, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13, 566, 10.1137/0213035