Inclusion Constraints over Non-empty Sets of Trees (1997)
Cached
Download Links
- [www.ps.uni-sb.de]
- [www.ag2.mpi-sb.mpg.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 13 - 5 self |
BibTeX
@MISC{Müller97inclusionconstraints,
author = {Martin Müller and Joachim Niehren and Andreas Podelski},
title = {Inclusion Constraints over Non-empty Sets of Trees},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
