Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic

@inproceedings{Glaer2016CircuitSA,
  title={Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic},
  author={Christian Gla{\ss}er and P. Jonsson and B. Martin},
  booktitle={CiE},
  year={2016}
}
We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [16] in the context of CSPs and settle the major open question from that paper, finding a certain satisfiability problem on circuits—involving complement, intersection, union and multiplication—to be decidable. This we prove using the decidability of Skolem Arithmetic. Then we solve a second question left open in [16] by… Expand
1 Citations

References

SHOWING 1-10 OF 30 REFERENCES
The complexity of satisfiability problems
Schaefer's theorem for graphs
Integer Circuit Evaluation Is PSPACE-Complete
  • Ke Yang
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2001
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2016
...
1
2
3
...