A 3-Part Type Inference Engine
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Entailment of Non-structural Subtype Constraints
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
A versatile constraint-based type inference system
Nordic Journal of Computing
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Automatic discovery of covariant read-only fields
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Feature treesare the formal basis for algorithms manipulating record likestructures in constraint programming, computational linguisticsand in concrete applications like software configuration management.Feature trees model records, and constraints over feature treesyield extensible and modular record descriptions. We introducethe constraint system FEAT of ordering constraintsinterpreted over feature trees. Under the view that feature treesrepresent symbolic information, the relation \leqcorresponds to the information ordering (’’carries less informationthan‘‘). We present two algorithms in cubic time, one for thesatisfiability problem and one for the entailment problem ofFEAT. We show that FEAT has the independence property.We are thus able to handle negative conjuncts via entailmentand obtain a cubic algorithm that decides the satisfiabilityof conjunctions of positive and negated ordering constraintsover feature trees. Furthermore, we reduce the satisfiabilityproblem of Dörre‘s weak subsumption constraints to the satisfiabilityproblem of FEAT and improve the complexity bound forsolving weak subsumption constraints from O(n^5)to O(n^3).