• DOI:10.1016/j.tcs.2017.08.025
Corpus ID: 205353497

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

View via Publisher

dro.dur.ac.uk

Save to Library

Create Alert

Cite

Launch Research Feed