Tarskian Set Constraints

Authors:
David A. McAllester;Robert Givan;Carl Witty;Dexter Kozen
Affiliations:
-;-;-;-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 16
Cited 9

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)
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
Decidability of Systems of Set Constraints with Negative Constraints

Decidability of Systems of Set Constraints with Negative Constraints
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Set constraints with projections are in NEXPTIME

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

On verifying consistency of XML specifications

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generalized Definite Set Constraints

Constraints
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Set constraints with intersection

Information and Computation - Special issue: LICS'97
Bibliography

The description logic handbook
Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators

Journal of Symbolic Computation
Set constraints with projections

Journal of the ACM (JACM)
Consistency of XML specifications

Inconsistency Tolerance

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 of the language.