Set Constraints in Some Equational Theories

Set constraints are relations between sets of ground terms over a given alphabet. They give a natural formalism for many problems in program analysis, type inference, order-sorted unification, and constraint logic programming. In this paper we start studies of set constraints in the environment given by equational specifications. We show that in the case of associativity (i.e., in free monoids) as well as in the case of associativity and commutativity (i.e., in commutative monoids) the problem of consistency of systems of set constraints is undecidable; in linear nonerasing shallow theories the consistency of systems of positive set constraints is NEXPTIME-complete and in linear shallow theories the problem for positive and negative set constraints is decidable.

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

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

[3]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[4]  Jean-Pierre Jouannaud,et al.  Decidable problems in shallow equational theories , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[5]  Jean-Pierre Jouannaud,et al.  Syntacticness, Cycle-Syntacticness, and Shallow Theories , 1994, Inf. Comput..

[6]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

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

[8]  Dexter Kozen.  Set Constraints and Logic Programming , 1994, CCL.

[9]  Alexander Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994, Inf. Comput..

[10]  Tomás E. Uribe.  Sorted Unification Using Set Constraints , 1992, CADE.

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

[12]  Sophie Tison,et al.  Solving systems of set constraints with negated subset relationships , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[13]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[14]  N. Heintze.  Set Based Analysis of Arithmetic , 1993 .

[15]  Witold Charatonik.  Set Constraints in Some Equational Theories , 1994, CCL.

[16]  Ramachandran Bharath,et al.  An introduction to Prolog , 1986 .

[17]  Alexander Aiken,et al.  Implementing Regular Tree Expressions , 1991, FPCA.

[18]  Sophie Tison,et al.  Solving Systems of Set Constraints using Tree Automata , 1993, STACS.

[19]  Prateek Mishra,et al.  Declaration-free type checking , 1985, POPL.

[20]  Alexander Aiken,et al.  Type inclusion constraints and type inference , 1993, FPCA '93.

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  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.

[23]  Alexander Aiken,et al.  Static type inference in a dynamically typed language , 1991, POPL '91.

[24]  John C. Reynolds,et al.  Automatic computation of data set definitions , 1968, IFIP Congress.

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

[26]  Nevin Charles Heintze,et al.  Set based program analysis , 1992 .

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

[28]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[29]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[30]  K. Stefansson,et al.  Systems of set constraints with negative constraints are NEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[32]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

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