# 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} }

- Published 2017 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2017.08.025

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

#### References

##### Publications referenced by this paper.

Showing 1-10 of 53 references

## The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

View 21 Excerpts

Highly Influenced

## Satisfiability of algebraic circuits over sets of natural numbers

View 10 Excerpts

Highly Influenced

## The Computational Complexity of Logical Theories

View 27 Excerpts

Highly Influenced

## Theory of linear and integer programming

View 3 Excerpts

Highly Influenced

## Emptiness Problems for Integer Circuits

View 1 Excerpt