Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

@article{Glaer2017CircuitSA,
  title={Circuit satisfiability and constraint satisfaction around Skolem Arithmetic},
  author={Christian Gla\sser and Peter Jonsson and Barnaby Martin},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={703},
  pages={18-36}
}
We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaßer et al. [1] 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 [1] by… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 53 references

The Computational Complexity of Logical Theories

J. Ferrante, C. W. Rackoff
Vol. 718 of Lecture Notes in Mathematics, Springer Verlag • 1979
View 27 Excerpts
Highly Influenced

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 3 Excerpts
Highly Influenced

A Dichotomy Theorem for Nonuniform CSPs

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) • 2017

A Proof of CSP Dichotomy Conjecture

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) • 2017