Autor*innen mit den meisten Dokumenten
Auflistung nach:
Neueste Veröffentlichungen
- ZeitschriftenartikelConstructing and Extending Description Logic Ontologies using Methods of Formal Concept Analysis(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Kriegel, FrancescoMy thesis describes how methods from Formal Concept Analysis can be used for constructing and extending description logic ontologies. In particular, it is shown how concept inclusions can be axiomatized from data in the description logics $$\mathcal {E}\mathcal {L}$$ E L , $$\mathcal {M}$$ M , $$\textsf {Horn}$$ Horn - $$\mathcal {M}$$ M , and $$\textsf{Prob}\text{-}\mathcal {E}\mathcal {L}$$ Prob - E L . All proposed methods are not only sound but also complete, i.e., the result not only consists of valid concept inclusions but also entails each valid concept inclusion. Moreover, a lattice-theoretic view on the description logic $$\mathcal {E}\mathcal {L}$$ E L is provided. For instance, it is shown how upper and lower neighbors of $$\mathcal {E}\mathcal {L}$$ E L concept descriptions can be computed and further it is proven that the set of $$\mathcal {E}\mathcal {L}$$ E L concept descriptions forms a graded lattice with a non-elementary rank function.
- ZeitschriftenartikelEditorial(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Ludwig, Bernd
- ZeitschriftenartikelQuantitative Variants of Language Equations and their Applications to Description Logics(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Marantidis, PavlosUnification in description logics (DLs) has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding different concepts that may potentially stand for the same intuitive notion. Together with the special case of matching, they were first investigated in detail for the DL $${\mathcal{FL}}_0$$ FL 0 , where these problems can be reduced to solving certain language equations. In this thesis, we extend this service in two directions. In order to increase the recall of this method for finding redundancies, we introduce and investigate the notion of approximate unification, which basically finds pairs of concepts that “almost” unify, in order to account for potential small modelling errors. The meaning of “almost” is formalized using distance measures between concepts. We show that approximate unification in $${\mathcal{FL}}_0$$ FL 0 can be reduced to approximately solving language equations, and devise algorithms for solving the latter problem for particular distance measures. Furthermore, we make a first step towards integrating background knowledge, formulated in so-called TBoxes, by investigating the special case of matching in the presence of TBoxes of different forms. We acquire a tight complexity bound for the general case, while we prove that the problem becomes easier in a restricted setting. To achieve these bounds, we take advantage of an equivalence characterization of $${\mathcal{FL}}_0$$ FL 0 concepts that is based on formal languages. Even though our results on the approximate setting cannot deal with TBoxes yet, we prepare the framework that future research can build on.
- ZeitschriftenartikelSpecial Issue on Ontologies and Data Management: Part I(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Schneider, Thomas; Šimkus, Mantas
- ZeitschriftenartikelNews(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020)
- Zeitschriftenartikelcrowd: A Visual Tool for Involving Stakeholders into Ontology Engineering Tasks(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Braun, Germán; Gimenez, Christian; Cecchi, Laura; Fillottrani, PabloWe present crowd , a web-based visual tool for ontology engineering tasks. Its aim is to involve ontology developers and domain experts into a collaborative comprehension and design of conceptual models, enhancing the communication between them and assessing their quality by fully integrating automatic reasoning in the tool. In this paper we briefly describe the initial requirements, architecture and user interface, and make an evaluation based on a use case and a comparison with related tools.
- 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.
- ZeitschriftenartikelMachine Understandable Policies and GDPR Compliance Checking(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Bonatti, Piero A.; Kirrane, Sabrina; Petrova, Iliana M.; Sauro, LuigiThe European General Data Protection Regulation (GDPR) calls for technical and organizational measures to support its implementation. Towards this end, the SPECIAL H2020 project aims to provide a set of tools that can be used by data controllers and processors to automatically check if personal data processing and sharing complies with the obligations set forth in the GDPR. The primary contributions of the project include: (i) a policy language that can be used to express consent, business policies, and regulatory obligations; and (ii) two different approaches to automated compliance checking that can be used to demonstrate that data processing performed by data controllers/processors complies with consent provided by data subjects, and business processes comply with regulatory obligations set forth in the GDPR.
- ZeitschriftenartikelRole-Value Maps and General Concept Inclusions in the Minimal Description Logic with Value Restrictions or Revisiting Old Skeletons in the DL Cupboard(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Baader, Franz; Théron, ClémentWe investigate the impact that general concept inclusions and role-value maps have on the complexity and decidability of reasoning in the description logic $$\mathcal{FL}_0$$ FL 0 . On the one hand, we give a more direct proof for ExpTime-hardness of subsumption w.r.t. general concept inclusions in $$\mathcal{FL}_0$$ FL 0 . On the other hand, we determine restrictions on role-value maps that ensure decidability of subsumption, but we also show undecidability for the cases where these restrictions are not satisfied.
- ZeitschriftenartikelOntologies for the Virtual Materials Marketplace(KI - Künstliche Intelligenz: Vol. 34, No. 3, 2020) Horsch, Martin Thomas; Chiacchiera, Silvia; Seaton, Michael A.; Todorov, Ilian T.; Šindelka, Karel; Lísal, Martin; Andreon, Barbara; Bayro Kaiser, Esteban; Mogni, Gabriele; Goldbeck, Gerhard; Kunze, Ralf; Summer, Georg; Fiseni, Andreas; Brüning, Hauke; Schiffels, Peter; Cavalcanti, Welchy LeiteThe Virtual Materials Marketplace (VIMMP) project, which develops an open platform for providing and accessing services related to materials modelling, is presented with a focus on its ontology development and data technology aspects. Within VIMMP, a system of marketplace-level ontologies is developed to characterize services, models, and interactions between users; the European Materials and Modelling Ontology is employed as a top-level ontology. The ontologies are used to annotate data that are stored in the ZONTAL Space component of VIMMP and to support the ingest and retrieval of data and metadata at the VIMMP marketplace frontend.