58 search results - page 2 / 12 » Inclusion Constraints over Non-empty Sets of Trees |
ICMLA
2010
13 years 3 months ago
2010
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
CL
2000
Springer
13 years 9 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
IS
2010
13 years 3 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
ESOP
1999
Springer
13 years 9 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...