On the Minimal Constraint Satisfaction Problem: Complexity and Generation

  title={On the Minimal Constraint Satisfaction Problem: Complexity and Generation},
  author={Guillaume Escamocher and Barry O’Sullivan},
The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by $$d\ge 9$$di?ź9. Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly, we generalize the complexity result to any value of d. We prove that the Minimal CSP… 
Pushing the frontier of minimality
Harnessing tractability in constraint satisfaction problems
This thesis attempts to bridge the gap between practitioners and theorists of CSP by providing polynomial-time algorithms to test for membership in a selection of major tractable classes, and proposes a general framework to adapt the concept of kernelization, central to parameterized complexity but hitherto rarely used in practice, to the context of constraint reasoning.
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP
A better characterization of the hardness of an individual satisfiable CSP instance is proposed based on the ratio between the size of the solution space and that of the search space and it is formally shown that this measure is negatively correlated with instance hardness.
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
  • W. V. Hoeve
  • Computer Science
    Lecture Notes in Computer Science
  • 2018
Two of Invited Talks Same, Same, but Different: A Mostly Discrete Tour Through Optimization shows how ideas about how a tour should be designed and executed can change over time and even change the tour itself.


On Minimal Constraint Networks
Generating Satisfiable Problem Instances
This paper proposes a generator that only outputs satisfiable problem instances and shows how one can finely control the hardness of the satisfiable instances by establishing a connection between problem hardness and a new kind of phase transition phenomenon in the space of problem instances.
Many hard examples in exact phase transitions
The complexity of satisfiability problems
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Exact Phase Transitions in Random Constraint Satisfaction Problems
  • Ke Xu, Wei Li
  • Computer Science, Mathematics
    J. Artif. Intell. Res.
  • 2000
It is proved that phase transitions from a region where almost all problems are satisfiable to a region Where almost all Problems are unsatisfiable do exist for Model RB as the number of variables approaches infinity.
Consistency restoration and explanations in dynamic CSPs Application to configuration
A sufficient condition for backtrack-bounded search
A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree, which leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems.
Local Search and the Number of Solutions
This paper examines the relationship between search cost and number of solutions at different points across the phase transition, for three different local search procedures, across two problem classes (CSP and SAT).
Phase Transitions and the Search Problem