Sciweavers

91 search results - page 10 / 19
» The Second Calculus of Binary Relations
Sort
View
FSS
2008
110views more  FSS 2008»
13 years 7 months ago
Learning valued preference structures for solving classification problems
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
Eyke Hüllermeier, Klaus Brinker
JUCS
2010
82views more  JUCS 2010»
13 years 2 months ago
The Separation of Relativized Versions of P and DNP for the Ring of the Reals
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...
Christine Gaßner
ECSQARU
2009
Springer
14 years 1 months ago
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
Salem Benferhat, Safa Yahi
POPL
1991
ACM
13 years 11 months ago
Subtyping Recursive Types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
Roberto M. Amadio, Luca Cardelli
IRI
2003
IEEE
14 years 20 days ago
A Formal Framework for Design Component Contracts
– Building large software systems out of existing software components can save time and cost. These software components range from architectural and design components to binary c...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan