Network-based heuristics for constraint satisfaction problems
@inproceedings{Dechter1988NetworkbasedHF, title={Network-based heuristics for constraint satisfaction problems}, author={R. Dechter and J. Pearl}, year={1988} }
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… CONTINUE READING
Topics from this paper
453 Citations
Constraint networks: a survey
- Mathematics
- 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation
- 1997
- 11
- PDF
A quantitative solution to Constraint Satisfaction Problem (CSP)
- Computer Science
- New Generation Computing
- 2009
Issues in the performance measurement of constraint-satisfaction techniques
- Computer Science
- Artif. Intell. Eng.
- 2000
- 5
References
SHOWING 1-10 OF 29 REFERENCES
The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation
- Mathematics, Computer Science
- IJCAI
- 1985
- 34
- PDF
The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
- Mathematics, Computer Science
- Artif. Intell.
- 1985
- 741
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
- Mathematics, Computer Science
- Artif. Intell.
- 1980
- 1,443
- PDF
Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics
- Mathematics, Computer Science
- Artif. Intell.
- 1983
- 171
A Problem Similarity Approach to Devising Heuristics: First Results
- Mathematics, Computer Science
- IJCAI
- 1979
- 71
- PDF