Solving Systems of Set Constraints with Negated Subset Relationships - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1993

Solving Systems of Set Constraints with Negated Subset Relationships

Résumé

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 (Heintze et Jaffar; Aiken et Wimmers; Gilleron, Tison and Tommasi; Bachmair, Gantzinger and Waldmann) and solves a problem which was left open in Bachmair et al. 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 describes here could be interesting in its own.
Fichier non déposé

Dates et versions

inria-00538879 , version 1 (23-11-2010)

Identifiants

  • HAL Id : inria-00538879 , version 1

Citer

Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93, 1993, Palo Alto California, United States. pp.372--380. ⟨inria-00538879⟩
96 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More