Sciweavers

146 search results - page 4 / 30
» Data Complexity in the EL Family of Description Logics
Sort
View
DLOG
2008
13 years 10 months ago
Classifying Fuzzy Subsumption in Fuzzy-EL+
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extension...
Giorgos Stoilos, Giorgos B. Stamou, Jeff Z. Pan
DLOG
2008
13 years 10 months ago
Paraconsistent Reasoning for Expressive and Tractable Description Logics
Abstract. Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage th...
Yue Ma, Pascal Hitzler, Zuoquan Lin
IJCAI
2003
13 years 9 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
FUIN
2010
106views more  FUIN 2010»
13 years 5 months ago
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
Linh Anh Nguyen
AAAI
2006
13 years 9 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter