Published: 2011 Juli
Type: Technical Report
Institution: Institut AIFB, KIT
Erscheinungsort / Ort: Karlsruhe
Semantic Web knowledge representation standards such as RDF and OWL have gained momentum in the last years and are widely applied today. A central design criterion for defining Semantic Web knowledge representation formalisms has often been that logical entailment has to be decidable. On the other hand, requiring decidable formalisms inevitably comes with constraints in terms of modeling power. In this paper we try to take a closer look at this requirement and discuss its importance in different scenarios. More concretely, we examine the modeling capabilities of undecidable ontology languages, such as OWL 2 Full, and propose the deployment of machinery from the successful domain of first-order theorem proving for obtaining incomplete - yet useful - reasoning support. We argue that this approach could act as a role model for knowledge representation formalisms from the Conceptual Structures community.