Tarskian set constraints

Authors:
Robert Givan;David McAllester;Carl Witty;Dexter Kozen
Affiliations:
Purdue Univ., West Lafayette, Indiana;AT&T Labs Research, Florham Park, NJ;Newton Research Labs, Renton, Washington;Cornell Univ., Ithaca, New York
Venue:
Information and Computation
Year:
2002

Citing 13
Cited 7

An automata theoretic decision procedure for the propositional mu-calculus

Information and Computation
A finite presentation theorem for approximating logic programs

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Attributive concept descriptions with complements

Artificial Intelligence
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Natural language syntax and first-order inference

Artificial Intelligence
Taxonomic syntax for first order inference

Journal of the ACM (JACM)
Efficient recursive subtyping

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft typing with conditional types

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient inference of partial types

Journal of Computer and System Sciences
Boosting the correspondence between description logics and propositional dynamic logics

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Decidability of systems of set constraints with negative constraints

Information and Computation
The Complexity of Set Constraints

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Logical Aspects of Set Constraints

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic

Automated theorem proving by resolution in non-classical logics

Annals of Mathematics and Artificial Intelligence
Efficient reasoning about data trees via integer linear programming

Proceedings of the 14th International Conference on Database Theory
Generalized satisfiability for the description logic ALC

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Collections, cardinalities, and relations

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Decision procedures for region logic

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Efficient reasoning about data trees via integer linear programming

ACM Transactions on Database Systems (TODS)
Generalized satisfiability for the description logic ALC

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.