Skip to main content
Article thumbnail
Location of Repository

Tarskian set constraints

By Robert Givan, David Mcallester, Carl Witty and Dexter KozenRobert Givan, David Mcallester, Carl Witty and Dexter Kozen

Abstract

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

Topics: Set constraints, decision procedures, dynamic logic, mu-calculus
Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.1792
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cornell.edu/~koz... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.