Inclusion Constraints over Non-Empty Sets of Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1997

Inclusion Constraints over Non-Empty Sets of Trees


We present a new constraint system called Ines. Its constraints are conjunctions of inclusions t1 subset t2 between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express Ines constraints only if they include negation. Their satisfiability problem is NEXPTIME-complete. We present an incremental algorithm that solves the satisfiability problem of Ines constraints in cubic time. We intend to apply Ines constraints for type analysis for a concurrent constraint programming language.
Fichier principal
Vignette du fichier
ines97.pdf (295.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536816 , version 1 (16-11-2010)


  • HAL Id : inria-00536816 , version 1


Martin Müller, Joachim Niehren, Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. pp.217-231. ⟨inria-00536816⟩
31 View
121 Download


Gmail Facebook X LinkedIn More