33 search results - page 3 / 7 » Least Common Subsumption as a connective |
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
DLOG
2004
13 years 7 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
KIVS
2001
Springer
13 years 10 months ago
2001
Springer
This paper discusses the performance of the Transmission Control Protocol under two aspects: First, the future Internet will provide some kind of service differentiation and bandw...
IANDC
2008
13 years 6 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
ICFP
2007
ACM
14 years 6 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...