• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Backtracking algorithms for constraint satisfaction problems (1999)

Cached

  • Download as a PDF

Download Links

  • [www.ics.uci.edu]
  • [ftp.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.cs.sfu.ca]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Rina Dechter , Daniel Frost
Citations:27 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Dechter99backtrackingalgorithms,
    author = {Rina Dechter and Daniel Frost},
    title = {Backtracking algorithms for constraint satisfaction problems},
    institution = {},
    year = {1999}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Over the past twenty veyears many backtracking algorithms have been developed for constraint satisfaction problems. This survey describes the basic backtrack search within the search space framework and then presents a number of improvements developed in the past two decades, including look-back methods such asbackjumping, constraint recording, backmarking, and look-ahead methods such as forward checking and dynamic variable ordering. 1

Citations

8882 Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
918 Consistency in networks of relations - Mackworth - 1977
837 Temporal constraint networks - Dechter, Meiri, et al. - 1991
719 Foundations of Constraint Satisfaction - Tsang - 1993
704 Constraint Logic Programming: A Survey - Jaffar, Maher - 1994
636 A machine program for theorem proving - Davis, Logemann, et al. - 1962
620 A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, et al. - 1992
501 Where the really hard problems are - Cheeseman, Kanefsky, et al. - 1991
412 Increasing Tree Search Efficiency for Constraint Satisfaction Problems - Haralick, Elliot - 1980
375 Networks of constraints: Fundamental properties and applications to picture processing - Montanari - 1974
360 Network-based heuristics for constraint satisfaction problems - Dechter, Pearl - 1987
328 Algorithms for constraint satisfaction problems: a survey - Kumar - 1992
323 Dynamic backtracking - Ginsberg - 1993
312 Graph Algorithms - Even - 1979
311 Hybrid algorithms for the constraint satisfaction problem - Prosser - 1993
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
244 Constraint satisfaction - Mackworth - 1987
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
192 Arc and path consistency revisited - Mohr, Henderson - 1986
186 Experimental results on the cross-over point in satisfiability problems - Crawford, Auton - 1993
183 Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey - Arnborg - 1985
179 Contradicting conventional wisdom in constraint satisfaction - Sabin, Freuder - 1994
176 A generic arc-consistency algorithm and its specializations - Hentenryck, Deville, et al. - 1992
142 Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method - Minton, Johnson, et al. - 1990
121 Constraint Satisfaction Algorithms - Nadel - 1989
106 Truth Maintenance - McAllester - 1990
105 A theoretical evaluation of selected backtracking algorithms - Kondrak, Beek - 1995
103 Backtrack programming techniques - Bitner, Reingold - 1975
77 Dual viewpoint heuristics for binary constraint satisfaction problems - Geelen - 1992
76 Search rearrangement backtracking and polynomial average time - Purdom - 1983
74 Backtrack programming - Golomb, Baumert - 1965
74 A language and a program for stating and for solving combinatorial problems - Laurière - 1978
73 A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem - Bayardo, Miranker - 1996
67 Dead-End Driven Learning - Frost, Dechter - 1994
67 Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisfying assignment problems - Gaschnig - 1978
66 An Optimal k-consistency Algorithm - Cooper - 1989
57 Look-ahead value ordering for constraint satisfaction problems - Frost, Dechter - 1995
53 Dynamic Variable Ordering in CSPs - Bacchus, Run - 1995
52 Relational consistency algorithms and their application in finding subgraph and graph isomorphism - McGregor - 1979
48 Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics - Nudel - 1983
44 Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results - Baker - 1995
34 Experimental evaluation of preprocessing algorithms for constraint satisfaction problems - Dechter, Meiri - 1994
30 The hazards of fancy backtracking - Baker - 1994
29 Solving combinatorial search problems by intelligent backtracking - Bruynooghe - 1981
29 Efficient search techniques - An empirical study of the n-queens problem - Stone, Stone - 1987
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University