Auflistung Künstliche Intelligenz 34(3) - September 2020 nach Schlagwort "Description logics"
1 - 4 von 4
Treffer pro Seite
Sortieroptionen
- ZeitschriftenartikelLETHE: Forgetting and Uniform Interpolation for Expressive Description Logics(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Koopmann, PatrickUniform interpolation and forgetting describe the task of projecting a given ontology into a user-specified vocabulary, that is, of computing a new ontology that only uses names from a specified set of names, while preserving all logical entailments that can be expressed with those names. This is useful for ontology analysis, ontology reuse and privacy. Lethe is a tool for performing uniform interpolation on ontologies in expressive description logics, and it can be used from the command line, using a graphical interface, and as a Java library. It furthermore implements methods for computing logical difference and performing abduction using uniform interpolation. We present the tool together with an evaluation on a varied corpus of realistic ontologies.
- ZeitschriftenartikelQuerying Rich Ontologies by Exploiting the Structure of Data(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Bajraktari, LabinotOntology-based data access (OBDA) has emerged as a paradigm for accessing heterogeneous and incomplete data sources. A fundamental reasoning service in OBDA, the ontology mediated query (OMQ) answering has received much attention from the research community. However, there exists a disparity in research carried for OMQ algorithms for lightweight DLs which have found their way into practical implementations, and algorithms for expressive DLs for which the work has had mainly theoretical oriented goals. In the dissertation, a technique that leverages the structural properties of data to help alleviate the problems that typically arise when answering the queries in expressive settings is developed. In this paper, a brief summary of the technique along with the different algorithms developed for OMQ for expressive DLs is given.
- ZeitschriftenartikelSATPin: Axiom Pinpointing for Lightweight Description Logics Through Incremental SAT(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Manthey, Norbert; Peñaloza, Rafael; Rudolph, SebastianOne approach to axiom pinpointing (AP) in description logics is its reduction to the enumeration of minimal unsatisfiable subformulas, allowing for the deployment of highly optimized methods from SAT solving. Exploiting the properties of AP, we further optimize incremental SAT solving, resulting in speedups of several orders of magnitude: through persistent incremental solving the solver state is updated lazily when adding clauses or assumptions. This adaptation consistently improves the runtime of the tool by an average factor of 3.8, and a maximum of 38. SATPin , our system, was tested over large biomedical ontologies and performed competitively.
- ZeitschriftenartikelTowards Higher-order OWL(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Homola, Martin; Kľuka, Ján; Hozzová, Petra; Svátek, Vojtěch; Vacura, MiroslavWe summarize our ongoing endeavour towards proposing a suitable higher-order description logic that could serve as the semantic foundation for higher-order OWL, similarly to $$\mathcal {SROIQ}$$ SROIQ serving as the semantic foundation of regular OWL.