Sciweavers

673 search results - page 54 / 135
» Approximate coherence-based reasoning
Sort
View
87
Voted
AUSAI
1999
Springer
15 years 4 months ago
Computing Least Common Subsumers in Expressive Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
Thomas Mantay
ATAL
2006
Springer
15 years 3 months ago
Automated semantic web service discovery with OWLS-MX
We present an approach to hybrid semantic Web service matching that complements logic based reasoning with approximate matching based on syntactic IR based similarity computations...
Matthias Klusch, Benedikt Fries, Katia P. Sycara
GIS
2010
ACM
14 years 10 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
TMC
2012
13 years 2 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 12 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart