• Corpus ID: 118256874

Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results

  title={Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results},
  author={Andrew B. Baker},
The Constraint Satisfaction Problem is a type of combinatorial search problem of much interest in Artificial Intelligence and Operations Research. The simplest algorithm for solving such a problem is chronological backtracking, but this method suffers from a malady known as "thrashing," in which essentially the same subproblems end up being solved repeatedly. Intelligent backtracking algorithms, such as backjumping and dependency-directed backtracking, were designed to address this difficulty… 
Backtracking Search Algorithms
  • P. V. Beek
  • Computer Science
    Handbook of Constraint Programming
  • 2006
A Uniform View of Backtracking
It is demonstrated that different backtracking algorithms can be categorized by the manner in which they discover, use, and store for future use, no-goods.
Extending Dynamic Backtracking for Distributed Constraint Satisfaction Problems
  • William S. Havens
  • Computer Science
    Australian Joint Conference on Artificial Intelligence
  • 1997
The existing DB caching scheme is briefly analysed from this perspective and two new improved caching algorithms are suggested that outperform dynamic backtrackinq in the multiaqent context.
Investigations into Satisfiability Search
The logical foundations of the backtracking mechanism are explored alongside formulations for reasoning in relevant logics which results in the development of a malleable back tracking mechanism that subsumes other intelligent backtracking proof construction techniques and allows the incorporation of proof rearrangement strategies.
Constraint satisfaction problem using modified branch and bound algorithm
A constraint satisfaction problem (CSP) involves assigning possible values to a set of variables without defying any constraints. There are various techniques available to solve or give partial
Phase transition behaviour in constraint satisfaction problems
It is shown that the phase transition paradigm can be applied to two tasks of polynomial cost complexity: attempting to establish arc and path consistency in a CSP and attempting to select the variable to instantiate at each stage in the search process.
Backjump-based backtracking for constraint satisfaction problems
Handbook of Constraint Programming
Modified branch and bound algorithm
There are various techniques available to solve or give partial solution to constraint satisfaction problem. This paper presents a modification of branch and bound algorithm, which is used to solve a
Backtracking algorithms for service selection
It is shown that the service selection problem can be mapped onto a Constraint Satisfaction Problem (CSP) and the benefit of this mapping is that the large know-how in the resolution of the CSP can be used for theservice selection problem.


Intelligent Backtracking on the Hardest Constraint Problems
This paper shows that outliers in the sparse region are not fundamentally diicult problems, and are easily handled by more sophisticated search strategies such as backjumping and dependency-directed backtracking.
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
It is found that scheduling problems bear fairly little resemblance to the previously studied hard randomly generated 3SAT problems, and the domain-specific heuristics developed to solve scheduling problems make surprisingly little difference in the time required to solve the problems.
Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method
A theoretical analysis is presented to explain why the heuristic method for solving large-scale constraint satisfaction and scheduling problems works so well on certain types of problems and to predict when it is likely to be most effective.
Consistency in Networks of Relations
Algorithms for Constraint-Satisfaction Problems: A Survey
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem, and a number of different approaches have been developed for solving them.
A Sufficient Condition for Backtrack-Free Search
A relationship involving the structure of the constraints is described which characterizes to some degree the extreme case of mimmum backtracking and a concept called "width," which may provide some guidance in the representation of constraint satisfaction problems and the order in which they are searched.
Solving Combinatorial Search Problems by Intelligent Backtracking
  • M. Bruynooghe
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1981