Affiliation:
1. Univ. of New Hampshire, Durham
Abstract
Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems. The solutions involve a combination of relaxation preprocessing and backtrack search. The bounds are expressed in terms of the structure of the constraint connections. Specifically, the effort is shown to have a bound exponential in the size of the largest biconnected component of the constraint graph, as opposed to the size of the graph as a whole.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference14 articles.
1. Backtrack programming techniques
2. A system for solving problems stated as procedures;FIKES R. E.;Artif Intell.,1970
3. FREUDER E.C. Synthesizing constraint expressions. Commun. ACM 2i ii (Nov. i978) 958- 966. 10.1145/359642.359654 FREUDER E.C. Synthesizing constraint expressions. Commun. ACM 2i ii (Nov. i978) 958- 966. 10.1145/359642.359654
4. A Sufficient Condition for Backtrack-Free Search
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Constraint Programming;Encyclopedia of Optimization;2023
3. Galois Connections for Patterns: An Algebra of Labelled Graphs;Lecture Notes in Computer Science;2021
4. New limits of treewidth-based tractability in optimization;Mathematical Programming;2020-09-15
5. Lower Bounds for QBFs of Bounded Treewidth;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08