Backjump-based backtracking for constraint satisfaction problems

Artificial Intelligence

Volumn 136, Issue 2, 2002, Pages 147-188

  Dechter, Rina ^a   Frost, Daniel ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Backjumping; Backtracking; Constraint satisfaction; Learning

Indexed keywords

ALGORITHMS; BACKPROPAGATION; CONSTRAINT THEORY; PROBLEM SOLVING;

BACKTRACKING ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0036532232     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00120-0     Document Type: Article

References (81)

1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey
2. Dynamic variable ordering in CSPs
3. The hazards of fancy backtracking
4. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
5. On the space-time trade-off in solving constraint satisfaction problems
6. Using CSP look-back techniques to solve real-world SAT instances
7. Arc-consistency and arc-consistency again
8. Using constraint metaknowledge to reduce arc consistency computation
9. Backtrack programming techniques
10. Solving combinatorial search problems by intelligent backtracking
11. Where the really hard problems are
12. Conflict-directed backjumping revisited
13. An optimal k-consistency algorithm
14. Experimental results on the crossover point in satisfiability problems
15. A machine program for theorem proving
16. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
17. Constraint networks
18. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
19. Network-based heuristics for constraint satisfaction problems
20. Tree clustering for constraint networks
21. Local and global relational consistency
22. Synthesizing constraint expressions
23. A sufficient condition for backtrack-free search
24. Dead-end driven learning
25. In search of the best constraint satisfaction search: An empirical evaluation
26. Look-ahead value ordering for constraint satisfaction problems
27. Looking at full look-ahead
28. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisfacing assignment problems
29. Dual viewpoint heuristics for binary constraint satisfaction problems
30. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
31. The constrainedness of search
32. Dynamic backtracking
33. Backtrack programming
34. Boosting combinatorial search through randomization
35. Increasing tree-search efficiency for constraint satisfaction problems
36. Constraint logic programming: A survey
37. Cliques, coloring, and satisfiability
38. A theoretical evaluation of selected backtracking algorithms
39. A theoretical evaluation of selected algorithms
40. Algorithms for constraint satisfaction problems: A survey
41. A language and a program for stating and solving combinatorial problems
42. Consistency in networks of relations
43. Constraint satisfaction
44. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
45. Grasp - A search algorithm for propositional satisfiability
46. Truth maintenance
47. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
48. Solution techniques for constraint satisfaction problems: Advanced approaches
49. Solution techniques for constraint satisfaction problems: Foundations
50. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
51. Arc and path consistency revisited
52. Networks of constraints: Fundamental properties and applications to picture processing
53. Constraint satisfaction algorithms
54. Some applications of the constraint satisfaction problem
55. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics
56. Arc consistency for factorable relations
57. A hybrid search architecture applied to hard random 3-SAT and low autocorrelation binary sequences
58. Hybrid algorithms for constraint satisfaction problems
59. Search rearrangement backtracking and polynomial average time
60. Constraint (logic) programming: A survey on research and applications
61. Contradicting conventional wisdom in constraint satisfaction
62. Variable and value ordering heuristics for activity-based job-shop scheduling
63. A new method for solving hard satisfiability problems
64. Trying harder to fail first
65. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
66. A generic arc-consistency algorithm and its specializations
67. Understanding line drawings of scenes with shadows
68. Asynchronous weak commitment search for solving distributed constraint satisfaction problems