Abstract

Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems (CSPs).

Citations

918	Consistency in networks of relations - Mackworth - 1977
552	A Truth Maintenance System - Doyle
412	Increasing Tree Search Efficiency for Constraint Satisfaction Problems - Haralick, Elliot - 1980
384	Theory of Relational Databases - Maier - 1983
375	Networks of constraints: Fundamental properties and applications to picture processing - Montanari - 1974
360	Network-based heuristics for constraint satisfaction problems - Dechter, Pearl - 1987
308	Understanding line drawings of scenes with shadows - WALTZ - 1975
250	Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition - Dechter - 1990
247	The complexity of some polynomial network consistency algorithms for constraint satisfaction problems - Mackworth, Freuder - 1985
238	A Sufficient condition for backtrack-free search - Freuder
230	Tree clustering for constraint networks - Dechter, Pearl - 1989
228	Synthesizing constraint expressions - Freuder - 1978
217	Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis - Stallman, Sussman - 1977
206	Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs - Tarjan, Yannakakis - 1984
183	Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey - Arnborg - 1985
157	Performance Measurement and Analysis of Certain Search Algorithms - Gaschnig - 1979
153	Nonserial Dynamic Programming - Bertele, Brioschi - 1972
141	M.: On the desirability of acyclic database schemes - Beeri, Fagin, et al. - 1983
137	A sufficient condition for backtrack-bounded search - Freuder - 1985
76	Graph Algorithms (Computer Science - Even - 1979
76	Search rearrangement backtracking and polynomial average time - Purdom - 1983
53	A su cient condition for backtrack-free search - Freuder - 1982
51	Experimental evaluation of preprocessing techniques in constraint satisfaction problems - Dechter, Meiri - 1989
47	Deduction revision by intelligent backtracking - Bruynooghe, Pereira - 1984
35	Increasing tree search eciency for constraint satisfaction problems - Haralick, Elliott - 1980
34	A new method for solving constraint satisfaction problems - Seidel - 1981
29	Directed constraint networks: A relational framework for causal reasoning - Dechter, Pearl - 1991
29	Efficient search techniques - An empirical study of the n-queens problem - Stone, Stone - 1987
13	Some applications of graph bandwidth to constraint satisfaction problems - ZABIH - 1990
5	Exact solution in linear time of networks of constraints using perfect relaxation - Rossi, Montanari - 1989
2	Modeling Probability Distributions with WEB Structures - Dalkey - 1991
2	Complexity of k-structured constraint satisfaction problems - Freuder - 1990