Constraint Satisfaction Problems and Finite Algebras

@inproceedings{Bulatov2000ConstraintSP,
  title={Constraint Satisfaction Problems and Finite Algebras},
  author={Andrei A. Bulatov and Andrei A. Krokhin and Peter Jeavons},
  booktitle={ICALP},
  year={2000}
}
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. In this paper we show that any restricted set of constraint types can be associated with a finite universal algebra. We explore how the computational complexity of a restricted constraint satisfaction problem is connected to properties of the corresponding algebra… Expand
A new tractable class of constraint satisfaction problems
  • V. Dalmau
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2005
TLDR
A new class of problems called para-primal problems, incomparable with the families identified by Feder and Vardi (1998), is introduced and it is proved that any constraint problem in this class is decidable in polynomial time. Expand
The property of being polynomial for Mal’tsev constraint satisfaction problems
A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various branches of mathematics, computer science, and AI. The generalizedExpand
The Weak Base Method for Constraint Satisfaction
TLDR
This thesis develops a method that allows to use a refined Galois correspondence to obtain complexity classifications for constraint satisfaction problems and achieves full classifications of the enumeration problem over the three-element domain. Expand
The weak base method for constraint satisfaction
TLDR
This thesis develops a method that allows to use a refined Galois correspondence to obtain complexity classifications for constraint satisfaction problems and achieves full classifications of the enumeration problem over the three-element domain. Expand
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
TLDR
A new general polynomial-time construction the fibre construction is introduced - which reduces any constraint satisfaction problem CSP(H) to the constraint satisfactionProblem CSP (P), where P is any subprojective relational structure, which provides a starting point for a new combinatorial approach to the NP-completeness part of the conjectured Dichotomy Classification of CSPs. Expand
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
TLDR
The quantified constraint satisfaction problem (QCSP), a more general framework in which variables can be quantified both universally and existentially, is concerned with and a complete complexity classification of maximal constraint languages is given. Expand
Constraint satisfaction with infinite domains
TLDR
Omega-categoricity is a rather strong model-theoretic assumption on a relational structure, and it can be used to show that many techniques for constraint satisfaction with finite templates extend to omega- categorical templates. Expand
Locally Finite Constraint Satisfaction Problems
TLDR
This work argues that locally finite templates, which contain potentially infinitely many finite relations, occur naturally in Descriptive Complexity Theory, and studies CSPs over such templates for both finite and infinite, definable instances. Expand
Periodic Constraint Satisfaction Problems: Tractable Subclasses
  • Hubie Chen
  • Mathematics, Computer Science
  • Constraints
  • 2005
TLDR
This work identifies two broad polynomial-time tractable subclasses of the periodic CSP, a generalization of the constraint satisfaction problem (CSP) that is natural for studying constraint networks consisting of constraints obeying a high degree of regularity or symmetry. Expand
Recognizing frozen variables in constraint satisfaction problems
TLDR
The complexity of the problem of recognizing frozen variables with restricted sets of constraint relations allowed in the instances is studied, and it is shown that the complexity of such problems is determined by certain algebraic properties of these relations. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
Closure properties of constraints
TLDR
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition. Expand
Tractable Constraints on Ordered Domains
TLDR
A restricted set of contraints is identified which gives rise to a class of tractable problems which generalizes the notion of a Horn formula in propositional logic to larger domain sizes, and it is proved that the class of problems generated by any larger set of constraints is NP-complete. Expand
On the Algebraic Structure of Combinatorial Problems
  • P. Jeavons
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1998
TLDR
A general algebraic formulation for a wide range of combinatorial problems including Satisfiability, Graph Colorability and Graph Isomorphism is described, and it is demonstrated that the complexity of solving this decision problem is determined in many cases by simple algebraic properties of the relational structures involved. Expand
The complexity of satisfiability problems
TLDR
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. Expand
Fast Parallel Constraint Satisfaction
  • L. Kirousis
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1993
TLDR
It is shown here that a CSP with this type of constraint relations (and no restrictions on its graph) can be solved by an efficient (i.e., with polynomial time complexity) sequential algorithm. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
TLDR
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand
A Survey of Tractable Constraint Satisfaction Problems
TLDR
The report surveys the various conditions that have been shown to be suucient to ensure tractability in constraint satisfaction problems, specifically on problems in which the domain of possible values for each variable is nite. Expand
Decomposing Constraint Satisfaction Problems Using Database Techniques
TLDR
It is proved that a constraint satisfaction problem may be decomposed into a number of subproblems precisely when the corresponding hypergraph satisfies a simple condition. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
The Logic of Constraint Satisfaction
TLDR
By casting CSP both as a generalization of FCSP and as a specialization of CLP it is observed that some, but not all, FCSP techniques lift to CSP and, perhaps, thereby to CLP. Expand
...
1
2
...