A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Tarskian set constraints
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
We investigate set constraints over set expressions with Tarskian functional and relational operations. Unlike the Herbrand constructor symbols used in recent set constraint formalisms, the meaning of a Tarskian function symbol is interpreted in an arbitrary first order structure. We show that satisfiability of Tarskian set constraints is decidable in nondeterministic doubly exponential time. We also give complexity results and open problems for various extensions and restrictions of the language.
doi:10.1109/lics.1996.561313
dblp:conf/lics/McAllesterGWK96
fatcat:egiwztqaqffflej7xan2kc3nmy