Consistency and Random Constraint Satisfaction Models

10/10/2011
by   J. Culberson, et al.
0

In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to improve the efficiency of CSP algorithms, is in fact the key to the design of random CSP models that have interesting phase transition behavior and guaranteed exponential resolution complexity without putting much restriction on the parameter of constraint tightness or the domain size of the problem. We propose a very flexible framework for constructing problem instances withinteresting behavior and develop a variety of concrete methods to construct specific random CSP models that enforce different levels of constraint consistency. A series of experimental studies with interesting observations are carried out to illustrate the effectiveness of introducing structural elements in random instances, to verify the robustness of our proposal, and to investigate features of some specific models based on our framework that are highly related to the behavior of backtracking search algorithms.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/19/2012

Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference

There has been great interest in identifying tractable subclasses of NP ...
11/05/2018

Biased landscapes for random Constraint Satisfaction Problems

The typical complexity of Constraint Satisfaction Problems (CSPs) can be...
05/09/2000

An Average Analysis of Backtracking on Random Constraint Satisfaction Problems

In this paper we propose a random CSP model, called Model GB, which is a...
07/20/2020

Phase Transition Behavior in Knowledge Compilation

The study of phase transition behaviour in SAT has led to deeper underst...
11/13/1998

The Essence of Constraint Propagation

We show that several constraint propagation algorithms (also called (loc...
11/17/2011

Unbiased Statistics of a CSP - A Controlled-Bias Generator

We show that estimating the complexity (mean and distribution) of the in...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.