Cargando…
OWL Reasoning: Subsumption Test Hardness and Modularity
Reasoning with [Formula: see text] , the logic that underpins the popular Web Ontology Language (OWL), has a high worst case complexity (N2Exptime). Decomposing the ontology into modules prior to classification, and then classifying the composites one-by-one, has been suggested as a way to mitigate...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Netherlands
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6044258/ https://www.ncbi.nlm.nih.gov/pubmed/30069069 http://dx.doi.org/10.1007/s10817-017-9414-8 |