• Corpus ID: 14897340

Constraint Satisfaction Problems around Skolem Arithmetic

  title={Constraint Satisfaction Problems around Skolem Arithmetic},
  author={Christian Gla{\ss}er and Peter Jonsson and Barnaby Martin},
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a certain satisfaction problem on circuits to be decidable. This we prove using the decidability of Skolem Arithmetic. We continue by studying first-order expansions of Skolem Arithmetic without constants, (N;*), where * indicates multiplication, as CSPs. We find… 

Tables from this paper

Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
    Electron. Colloquium Comput. Complex.
  • 2016
The computational complexity of constraint satisfaction problems that are based on integer expressions and algebraic circuits, such as L, P, NP, PSPACE, NEXP, and even Sigma_1, the class of c.e. languages, is studied.
Emptiness Problems for Integer Circuits
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a major open problem in algebraic computing complexity.


Complexity of subcases of Presburger arithmetic
We consider formula subclasses of Presburger arithmetic which have a simple structure in one sense or the other and investigate their computational complexity. We also prove some results on the lower
The complexity of temporal constraint satisfaction problems
This work presents a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint language, then the CSP can be solved in polynomial time; otherwise, the C SP is NP-complete.
Constraint Satisfaction Problems over the Integers with Successor
This work says that every distance CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP in which case the computational complexity is not known in general.
Schaefer's Theorem for Graphs
It is proved that either Ψ is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete.
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
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.
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics
    Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
The integer circuit problem is PSPACE-complete, resolving an open problem posed by P. McKenzie, H. Vollmer, and K. W. Wagner (2000).
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.