1

January 2017
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 1, Downloads (12 Months): 7, Downloads (Overall): 22

Full text available:

PDF
An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the ...

2

January 2015
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 2

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Downloads (Overall): 36

Full text available:

PDF
We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. ...

3

November 2013
ACM Transactions on Computation Theory (TOCT): Volume 5 Issue 4, November 2013

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 10

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Downloads (Overall): 126

Full text available:

PDF
An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least a (1 − f ( ε ))-fraction of constraints for each (1 − ε )-satisfiable instance (i.e., such that at most a ε -fraction of constraints needs to be removed to make ...

**Keywords**:
universal algebra, approximation algorithms, Constraint satisfaction problem, homomorphism duality

4

February 2013
Journal of Logic and Computation: Volume 23 Issue 1, February 2013

**Publisher:** Oxford University Press

A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language . In this article, we study arc consistency, a heavily investigated inference method, and three extensions thereof ...

5

May 2008
Journal of Computer and System Sciences: Volume 74 Issue 3, May, 2008

**Publisher:** Academic Press, Inc.

We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result is a surprising proof that the ...

**Keywords**:
Width, Constraint satisfaction problems, Resolution, Finite model theory, Pebble games, 3-CNF formula

6

September 2007
Theoretical Computer Science: Volume 382 Issue 3, September, 2007

**Publisher:** Elsevier Science Publishers Ltd.

Intersection-closed classes of concepts arise naturally in many contexts and have been intensively studied in computational learning theory. In this paper, we study intersection-closed classes that contain the concepts invariant under an operation satisfying a certain algebraic condition. We give a learning algorithm in the exact model with equivalence queries ...

**Keywords**:
Polymorphism, Closure algorithm, Computational learning, Quantified formulas

7

July 2007
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming

**Publisher:** Springer-Verlag

The k -consistency algorithm for constraint-satisfaction problems proceeds, roughly, by finding all partial solutions on at most k variables and iteratively deleting those that cannot be extended to a partial solution by one more variable. It is known that if the core of the structure encoding the scopes of the ...

8

June 2007
Discrete Applied Mathematics: Volume 155 Issue 12, June, 2007

**Publisher:** Elsevier Science Publishers B. V.

The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in all likelihood harder than NP-complete problems. We investigate the existence of phase transitions for a family of ...

**Keywords**:
Satisfiability, PP-complete, Phase transitions

9

May 2007
Information and Computation: Volume 205 Issue 5, May, 2007

**Publisher:** Academic Press, Inc.

The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the values that can be taken simultaneously by some variables, determine the number of ...

**Keywords**:
Complexity, Constraint satisfaction problem, Counting problems

10

July 2006
SIAM Journal on Computing: Volume 36 Issue 1, 2006

**Publisher:** Society for Industrial and Applied Mathematics

A Mal'tsev operation is a ternary operation $\varphi$ that satisfies the identities $\varphi(x,y,y) = \varphi(y,y,x) = x$. Constraint satisfaction problems involving constraints invariant under a Mal'tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroup and near subgroup constraints, and many others. It ...

**Keywords**:
Mal'tsev, constraint satisfaction

11

October 2005
CP'05: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming

**Publisher:** Springer-Verlag

We contribute to the algebraic study of the complexity of constraint satisfaction problems. We give a new sufficient condition on a set of relations Γ over a domain S for the tractability of CSP(Γ): if S is a block-group (a particular class of semigroups) of exponent ω and Γ is ...

12

May 2005
Annals of Mathematics and Artificial Intelligence: Volume 44 Issue 1-2, May 2005

**Publisher:** Kluwer Academic Publishers

In this paper we consider constraint satisfaction problems where the set of constraint relations is fixed. Feder and Vardi (1998) identified three families of constraint satisfaction problems containing all known polynomially solvable problems. We introduce a new class of problems called para-primal problems, incomparable with the families identified by Feder ...

**Keywords**:
complexity, para-primal algebra, constraint satisfaction problem

13

December 2004
Theoretical Computer Science: Volume 329 Issue 1-3, 13 December 2004

**Publisher:** Elsevier Science Publishers Ltd.

For every class of relational structures C , let HOM( C , _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B. Grohe has proved that, under a certain complexity-theoretic assumption, HOM( C , _) is solvable in polynomial ...

**Keywords**:
computational complexity, relational structure, counting, homomorphism

14

July 2004
LICS '04: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

**Publisher:** IEEE Computer Society

A retraction from a structure P to its substructure Q is a homomorphism from P onto Q that is the identity on Q. We present an algebraic condition which completely characterises all posets and all reflexive graphs Q with the following property: the class of all posets or reflexive graphs, ...

15

October 2003
FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

**Publisher:** IEEE Computer Society

The Counting Constraint Satisfaction Problem (#CSP) over a .nite domain can be expressed as follows: given a first-order formula consisting of a conjunction of predicates, determine the number of satisfying assignments to the formula. #CSP can be parametrized by the set of allowed constraint predicates. In this paper we start ...

16

September 2003
Theoretical Computer Science: Volume 306 Issue 1-3, 5 September 2003

**Publisher:** Elsevier Science Publishers Ltd.

We consider the following classes of quantified formulas. Fix a set of basic relations called a basis. Take conjunctions of these basic relations applied to variables and constants in arbitrary ways. Finally, quantify existentially or universally some of the variables. We introduce some conditions on the basis that guarantee efficient ...

**Keywords**:
computational learning, quantified formulas, clones

17

September 2003
Theoretical Computer Science: Volume 306 Issue 1, September 2003

**Publisher:** Elsevier Science Publishers Ltd.

We consider the following classes of quantified formulas. Fix a set of basic relations called a basis. Take conjunctions of these basic relations applied to variables and constants in arbitrary ways. Finally, quantify existentially or universally some of the variables. We introduce some conditions on the basis that guarantee efficient ...

**Keywords**:
Computational learning, Quantified formulas, Clones

18

September 2002
CP '02: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

**Publisher:** Springer-Verlag

We systematically investigate the connections between constraint satisfaction problems, structures of bounded treewidth, and definability in logics with a finite number of variables. We first show that constraint satisfaction problems on inputs of treewidth less than k are definable using Datalog programs with at most k variables; this provides a ...

19

July 2002
Eighteenth national conference on Artificial intelligence

**Publisher:** American Association for Artificial Intelligence

The study of phase transitions in algorithmic problems has revealed that usually the critical value of the constrainedness parameter at which the phase transition occurs coincides with the value at which the average cost of natural solvers for the problem peaks. In particular, this confluence of phase transition and peak ...

20

July 2002
ICALP '02: Proceedings of the 29th International Colloquium on Automata, Languages and Programming

**Publisher:** Springer-Verlag

We study which constraint satisfaction problems (CSPs) are solvable in NL. In particular, we identify a general condition called bounded path duality, that explains all the families of CSPs previously known to be in NL. Bounded path duality captures the class of constraint satisfaction problems that can be solved by ...