Tarskian set constraints

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.

[1]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[2]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[3]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[4]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[5]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[6]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[7]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[8]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[9]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  S. Safra.  On The Complexity of w-Automata , 1988 .

[12]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[13]  Joxan Jaffar,et al.  A finite presentation theorem for approximating logic programs , 1989, POPL '90.

[14]  Robert Goldblatt,et al.  Varieties of Complex Algebras , 1989, Ann. Pure Appl. Log..

[15]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[16]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[17]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[18]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[19]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[20]  Robert Givan,et al.  Natural Language Syntax and First-Order Inference , 1992, Artificial Intelligence.

[21]  Robert Givan,et al.  New Results on Local Inference Relations , 1992, KR.

[22]  Jens Palsberg,et al.  Efficient inference of partial types , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[23]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[24]  Alexander Aiken,et al.  The Complexity of Set Constraints , 1993, CSL.

[25]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[26]  Robert Givan,et al.  Taxonomic syntax for first order inference , 1989, JACM.

[27]  Jens Palsberg,et al.  Efficient recursive subtyping , 1992, POPL '93.

[28]  Witold Charatonik,et al.  Negative set constraints with equality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[29]  Alexander Aiken,et al.  Soft typing with conditional types , 1994, POPL '94.

[30]  Diego Calvanese,et al.  A Unified Framework for Class-Based Representation Formalisms , 1994, KR.

[31]  A. Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994 .

[32]  Maurizio Lenzerini,et al.  Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.

[33]  Maurizio Lenzerini,et al.  Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus , 1994, ECAI.

[34]  Witold Charatonik,et al.  Set constraints with projections are in NEXPTIME , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.