# Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

@article{Glaer2017CircuitSA, title={Circuit satisfiability and constraint satisfaction around Skolem Arithmetic}, author={Christian Gla{\ss}er and Peter Jonsson and Barnaby Martin}, journal={Theor. Comput. Sci.}, year={2017}, volume={703}, pages={18-36} }

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

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

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 33 REFERENCES

## Schaefer's theorem for graphs

VIEW 1 EXCERPT

## Complexity of Equations over Sets of Natural Numbers

VIEW 1 EXCERPT

## Functions Definable by Arithmetic Circuits

VIEW 1 EXCERPT