Sciweavers

342 search results - page 55 / 69
» Tableau Algorithms for Description Logics
Sort
View
DELTA
2004
IEEE
14 years 11 days ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
CIKM
2008
Springer
13 years 10 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...
AAAI
2010
13 years 10 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
DLOG
2004
13 years 10 months ago
Pellet: An OWL DL Reasoner
Reasoning capability is of crucial importance to many applications developed for the Semantic Web. Description Logics provide sound and complete reasoning algorithms that can effe...
Evren Sirin, Bijan Parsia
ENTCS
2006
110views more  ENTCS 2006»
13 years 8 months ago
Semantic Interoperability of Heterogeneous Semantic Resources
This paper presents a three-step approach for interoperabilising heterogeneous semantic resources. Firstly, we construct homogeneous representations of these resources in a pivot ...
Catarina Ferreira Da Silva, Lionel Médini, ...