Solving systems of set constraints with negated subset relationships

Authors:
R. Gilleron;S. Tison;M. Tommasi
Affiliations:
Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France;Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France;Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 3

Constraint solving on terms

Constraints in computational logics
Atomic Set Constraints with Projection

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Set constraints with projections

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a decision procedure, based on tree automata techniques, for satisfiability of systems of set constraints including negated subset relationships. This result extends all previous works on set constraints solving and solves a problem which was left open by L. Bachmair et al. (1993). We prove in a constructive way that a non empty set of solutions always contains a regular solution, that is a tuple of regular tree languages. Moreover, we think that the new class of tree automata described here could be interesting in its own.