Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

@article{Glaer2017CircuitSA,
  title={Circuit satisfiability and constraint satisfaction around Skolem Arithmetic},
  author={C. Gla{\ss}er and P. Jonsson and B. Martin},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={703},
  pages={18-36}
}
  • C. Glaßer, P. Jonsson, B. Martin
  • Published 2017
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • Abstract We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser 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… CONTINUE READING
    7 Citations
    Emptiness problems for integer circuits
    Emptiness Problems for Integer Circuits
    • 4
    • PDF
    Balance problems for integer circuits
    • T. Dose
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2019
    • 1
    • PDF
    Balance Problems for Integer Circuits
    • T. Dose
    • Computer Science, Mathematics
    • Electron. Colloquium Comput. Complex.
    • 2018
    Constraint Satisfaction Problems over Numeric Domains
    • 9
    • PDF

    References

    SHOWING 1-10 OF 60 REFERENCES
    Emptiness Problems for Integer Circuits
    • 4
    • PDF
    Satisfiability of Algebraic Circuits over Sets of Natural Numbers
    • 6
    • PDF
    A Proof of CSP Dichotomy Conjecture
    • D. Zhuk
    • Mathematics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017
    • 209
    • PDF
    The complexity of satisfiability problems
    • 1,830
    • PDF
    Complexity of subcases of Presburger arithmetic
    • 56
    • PDF
    Integer circuit evaluation is PSPACE-complete
    • K. Yang
    • Mathematics, Computer Science
    • Proceedings 15th Annual IEEE Conference on Computational Complexity
    • 2000
    • 17
    A Dichotomy Theorem for Nonuniform CSPs
    • A. A. Bulatov
    • Mathematics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017
    • 220
    • PDF
    Schaefer's Theorem for Graphs
    • 63
    • PDF