Sciweavers

3758 search results - page 34 / 752
» A Complete Subsumption Algorithm
Sort
View
ASWC
2008
Springer
13 years 9 months ago
A Modularization-Based Approach to Finding All Justifications for OWL DL Entailments
Finding the justifications for an entailment (i.e., minimal sets of axioms responsible for it) is a prominent reasoning service in ontology engineering, as justifications facilitat...
Boontawee Suntisrivaraporn, Guilin Qi, Qiu Ji, Pet...
ISTA
2003
13 years 9 months ago
Capturing Semantics from Search Phrases: Incremental User Personification and Ontology-Driven Query Transformation
: Reported is the methodology of the semantic transformation of an initial user’s search query in the form of key words or key phrases to the resulting query composed of the rele...
Vadim Ermolayev, Natalya Keberle, Sergey Plaksin, ...
AICOM
2006
124views more  AICOM 2006»
13 years 7 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
ENTCS
2006
110views more  ENTCS 2006»
13 years 7 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, ...
KI
2006
Springer
13 years 7 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...