Sciweavers

20 search results - page 4 / 4
» Decidability of Description Logics with Transitive Closure o...
Sort
View
TABLEAUX
2005
Springer
13 years 10 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
Carsten Lutz, Maja Milicic
CADE
2006
Springer
14 years 5 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
IANDC
2008
122views more  IANDC 2008»
13 years 5 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
TABLEAUX
2005
Springer
13 years 10 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
SEMWEB
2007
Springer
13 years 11 months ago
Semantic Cooperation and Knowledge Reuse by Using Autonomous Ontologies
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. ...
Yuting Zhao, Kewen Wang, Rodney W. Topor, Jeff Z. ...