33 search results - page 4 / 7 » Least Common Subsumption as a connective |
DLOG
2007
13 years 10 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
VC
2008
13 years 7 months ago
2008
Our daily life is pervaded by digital information and devices, not least the common mobile phone. However, a seamless connection between our physical world, such as a movie trailer...
GD
1999
Springer
13 years 12 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
CCCG
2004
13 years 9 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
MSS
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper analyzes a two-alternative voting model with the distinctive feature that voters have preferences over the support that each alternative receives, and not only over the...