This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
: 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...
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...
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...
– 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...