Locating the Phase Transition in Binary Constraint Satisfaction Problems

@article{Smith1996LocatingTP,
  title={Locating the Phase Transition in Binary Constraint Satisfaction Problems},
  author={Barbara M. Smith and M. Dyer},
  journal={Artif. Intell.},
  year={1996},
  volume={81},
  pages={155-181}
}
Abstract The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solutions, as the constraints become tighter, is investigated by examining the behaviour of samples of randomly-generated problems. In contrast to theoretical work, which is concerned with the asymptotic behaviour of problems as the number of variables becomes larger, this paper is concerned… Expand
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
TLDR
An alternative scheme for one of the standard models is proposed in which both the number of values in each variable's domain and the average degree of the constraint graph are increased with problem size, and it is shown that with this scheme there is asymptotically a range of values of the constraints tightness. Expand
Predicting Phase Transitions of Binary CSPs with Local Graph Topology
TLDR
A new phase transition predictor which takes constraint graph information into consideration is proposed and empirical results show that the new predictor is able to produce considerably better prediction than Smith’s predictor for sparsely constrained problems. Expand
Sharp Thresholds for a Random Constraint Satisfaction Problem
The phenomenon of phase transition in constraint satisfaction problems (CSPs) plays a crucial role in the field of artificial intelligence and computational complexity theory. In this paper, weExpand
An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems
TLDR
It is shown that the theory of binary constraint satisfaction predicts where the hardest problems should occur, in close agreement with the empirical results, except when constraint graphs are sparse. Expand
Where the Exceptionally Hard Problems Are 1
Constraint satisfaction problems exhibit a phase transition as a problem parameter is varied, from a region where most problems are easy and soluble to a region where most problems are easy butExpand
A New Model of Hard Binary Constraint Satisfaction Problems
TLDR
A refined version of their predictor is given which incorporates the local graph topology of each individual CSP and it is shown that there is a similar phase transition in which constraint tightness does not have to be a global value and that the refined predictor better predicts the location of this phase transition. Expand
Problem Difficulty and the Phase Transition in Heuristic Search
TLDR
This work establishes the existence of a rapid transition in the solubility of an abstract model of heuristic search problems and shows that, for greedy best first search, the hardest instances are associated with the phase transition region. Expand
Predicting Phase Transitions of Binary Constraint Satisfaction Problems with Constraint Graph Information
TLDR
Results show that the new phase transition predictor is able to produce predictions as good as the state-of-the-art predictor in general, but do considerably better in sparsely constrained problems, particularly when the node degree variation in their constraint graphs is high. Expand
Solution space structure of random constraint satisfaction problems with growing domains
TLDR
This paper rigorously shows that in the satisfiable phase close to the satisfiability transition, solutions are clustered into an exponential number of well-separated clusters, with each cluster containing a sub-exponential number of solutions. Expand
The Constrainedness of Arc Consistency
TLDR
As with NP-complete problems, constrainedness — and proxies for it which are cheaper to compute — can be used as a heuristic for reducing the number of checks needed to establish arc consistency in AC3. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems
TLDR
It is shown that the theory of binary constraint satisfaction predicts where the hardest problems should occur, in close agreement with the empirical results, except when constraint graphs are sparse. Expand
Where the Really Hard Problems Are
TLDR
It is shown that NP-complete problems can be summarized by at least one "order parameter", and that the hard problems occur at a critical value of such a parameter. Expand
Network-based heuristics for constraint satisfaction problems
TLDR
This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally by generating heuristic advice to guide the order of value assignments based on both the sparseness found in the constraint network and the simplicity of tree-structured CSPs. Expand
Experimental Results on the Crossover Point in Satisfiability Problems
TLDR
Empirically, it is found that for random 3-SAT problems below the crossover point, the average time complexity of satisfiability problems seems empirically to grow linearly with problem size, and at and above therossover point the complexity seems to grow exponentially, but the rate of growth seems to be greatest near the crossoverpoint. Expand
Exploiting the Deep Structure of Constraint Problems
TLDR
A technique for analyzing the behavior of sophisticated AI search programs working on realistic, large-scale problems is introduced and it is suggested that this type of analysis can be generalized to other kinds of AI problems. Expand
Critical Behavior in the Satisfiability of Random Boolean Expressions
TLDR
Finite-size scaling, a method from statistical physics, can be used to characterize size-dependent effects near the threshold and a relationship can be drawn between thresholds and computational complexity. Expand
Extending Deep Structure
TLDR
It is shown that the phase transition phenomenon exists for a much wider class of search algorithms than had hitherto been thought and theoretically why this is the case. Expand
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
TLDR
Analytically and experimentally show that a lookahead procedure called forward checking which employs the most likely to fail principle performs better than standard backtracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all cases tested, and better than Gaschnig's backmarking in the larger problems. Expand
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
TLDR
This paper presents an approach that allows base algorithms to be combined, giving us new hybrids, and it is shown that FC‐CBJ is by far the best of the algorithms examined. Expand
Using Deep Structure to Locate Hard Problems
TLDR
This paper shows how to predict where, in a space of problem instances, the hardest problems are to be found and where the fluctuations in difficulty are greatest. Expand
...
1
2
...