Failure Analysis in Backtrack Search for Constraint Satisfaction
نویسندگان
چکیده
Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this paper we attempt to enhance our understanding of these algorithms by employing heatmap-based visualisations. We perform a large empirical study of search, for a variety of problem classes, and we report several interesting observations. Our results show that, contrary to conventional wisdom, it is not always the case that mistakes made at the top of the search tree are exponentially more expensive to refute than those made deeper in the tree, or that over a population of instances the largest mistakes dominate search effort. Furthermore, we show empirically that heavy-tailed runtime distributions can occur even if the number of mistakes is small, and that instance and mistake-based runtime distributions can be very similar. Finally, we study the complex relationship between the promise and fail-firstness of variable ordering heuristics.
منابع مشابه
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-spacebounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constraints with limited size, and another records arbitrarily large cons...
متن کاملA Revised Su cient Condition for Backtrack-Free Search
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that ...
متن کاملContradicting Conventional Wisdom in Constraint Satisfaction
Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Two standard techniques used in solving such problems are backtrack search and consistency inference. Conventional wisdom in the constraint satisfact...
متن کاملBacktracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a well-known NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving this type of problems involves using depth-first backtrack search. In our earlier work, we f...
متن کاملOptimal Refutations for Constraint Satisfaction Problems
Variable ordering heuristics have long been an important component of constraint satisfaction search algorithms. In this paper we study the behaviour of standard variable ordering heuristics when searching an insoluble (sub)problem. We employ the notion of an optimal refutation of an insoluble (sub)problem and describe an algorithm for obtaining it. We propose a novel approach to empirically lo...
متن کاملBacktracking Algorithms for Constraint Satisfaction Problems { a Survey
Over the past twenty years, a number of backtracking algorithms for constraint satisfaction problems, have been developed. This survey describes the basic backtrack search within the search space framework and then presents a number of improvements including look-back methods such as backjumping, constraint recording, backmarking, and look-ahead methods such as, forward checking, and dynamic va...
متن کامل