Increasing tree search efficiency for constraint satisfaction problems
References (17)
- et al.
Reduction operations for constraint satisfaction
Information Sci.
(1978) Consistency in networks of relations
Artificial Intelligence
(1977)- et al.
MYSIS: A system for reasoning about scenes
A general backtrack algorithm that eliminates most redundant tests
Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing-assignment problems
Performance measurement and analysis of certain search algorithms
Scene analysis: Homomorphisms, and arrangements
- et al.
The consistent labeling problem: Part I
IEEE Trans. Pattern Analysis and Machine Intelligence
(April 1979)
There are more references available in the full text version of this article.
Cited by (795)
Modified dynamic programming for asteroids belt exploration
2024, Acta AstronauticaHost-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
2023, Journal of Logical and Algebraic Methods in ProgrammingDynamic pipelining for the loosely-coupled distributed constraint satisfaction problems
2022, Computers and Electrical EngineeringA new branch-and-filter exact algorithm for binary constraint satisfaction problems
2022, European Journal of Operational ResearchLearning variable ordering heuristics for solving Constraint Satisfaction Problems
2022, Engineering Applications of Artificial IntelligenceCitation Excerpt :However, finding the optimal ordering, i.e. the one results in a minimal-sized search tree, is at least as hard as solving the CSP (Liberatore, 2000; Rossi et al., 2006). Therefore, current practice mainly relies on hand-crafted variable ordering heuristics obtained from the experience of human experts, such as MinDom (Haralick and Elliott, 1980), Dom/Ddeg (Bessiere and Régin, 1996), and impact-based heuristic (Refalo, 2004). Though they are easy to use and widely adopted, they do not have any formal guarantees on the optimality.
Copyright © 1980 Published by Elsevier B.V.