3134 search results - page 8 / 627 » Computing full disjunctions |
104
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...
120
click to vote
TLCA
2001
Springer
15 years 6 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
115
click to vote
PKDD
1999
Springer
15 years 6 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
129
Voted
COLOGNETWENTE
2009
15 years 2 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
109
click to vote
AUSAI
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...