Abstract
We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1⊆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.
Cite
CITATION STYLE
Müller, M., Niehren, J., & Podelski, A. (1997). Inclusion constraints over non-empty sets of trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1214, pp. 345–356). Springer Verlag. https://doi.org/10.1007/bfb0030609
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
