.png){kind=icon}
.png){kind=icon}
Return
Ontological Modelling Principles for Computational Complexity
.png){kind=icon}
PRE
AI
DOI：10.1177/15705838261451614.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
<jats:p>
The field of computational complexity theory is a core theoretical subject in computer science with significant impact also for real-world applications. Although a plethora of individual results are known, a systematic conceptual organisation of this knowledge is still lacking. We propose a modelling approach for creating an ontologically well-founded knowledge base for the theory of computational complexity that will enable storing, querying and reasoning over the vast knowledge of algorithmic problems, complexity classes and their relationships. We determine the core concepts and relations of complexity theory and model them on two levels of approximation: a lightweight version based on the decidable description logic
<jats:inline-formula>
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll">
<mml:mrow>
<mml:mrow>
<mml:mi mathvariant="script">S</mml:mi>
<mml:mi mathvariant="script">R</mml:mi>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mi mathvariant="script">I</mml:mi>
<mml:mi mathvariant="script">Q</mml:mi>
</mml:mrow>
</mml:mrow>
</mml:math>
</jats:inline-formula>
(the underlying formalism of the ontology language OWL 2 DL) and a further extended version based on first-order logic.
</jats:p>
Journal
IF:
3.5
Papers:
37
Citations:
306