Abstract : 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.
Type de document :
Communication dans un congrès
Max Dauchet. Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. Springer, 1214, pp.217-231, 1997, Lecture Notes on Computer Science
https://hal.inria.fr/inria-00536816
Contributeur : Joachim Niehren
<>
Soumis le : mardi 16 novembre 2010 - 23:09:59
Dernière modification le : lundi 20 novembre 2017 - 15:14:01
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:15:59
Martin Müller, Joachim Niehren, Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Max Dauchet. Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. Springer, 1214, pp.217-231, 1997, Lecture Notes on Computer Science. 〈inria-00536816〉
