Publication:3624118

From MaRDI portal
Revision as of 05:58, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1183.68479MaRDI QIDQ3624118

No author found.

Publication date: 28 April 2009




Related Items

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization, Progression of Decomposed Local-Effect Action Theories, Knowledge base exchange: the case of OWL 2 QL, ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS, Reasoning within intuitionistic fuzzy rough description logics, OWL reasoning: subsumption test hardness and modularity, Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design, Logic-based ontology comparison and module extraction, with an application to DL-Lite, Effective method for detecting error causes from incoherent biological ontologies, On decidability of the decomposability problem for finite theories, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Modeling ontology evolution with SetPi, Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \), Incremental classification of description logics ontologies, Formal Properties of Modularisation, On Importing Knowledge from Ontologies., ReAD: AD-based modular ontology classification, Mathematical Logic for Life Science Ontologies, Query inseparability for \(\mathcal{ALC}\) ontologies, Deciding inseparability and conservative extensions in the description logic, Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\), Universal Logic as a Science of Patterns, Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL, Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications, The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies, Games for query inseparability of description logic knowledge bases


Uses Software