Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper. / This research was carried out while the second author was still at the LuFG Theoretical Computer Science, RWTH Aachen.

When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, updates generate so-called Boolean ABoxes, which cannot be handled by traditional Description Logic reasoners. Second, iterated update operations result in very large Boolean ABoxes, which, however, contain a huge amount of redundant information. In this paper, we address both issues from a practical point of view.

Whereas matching in Description Logics is now relatively well investigated, there are only very few formal results on matching under additional side conditions, though these side conditions were already present in the original paper by Borgida and McGuinness introducing matching in DLs. The present report closes this gap for the DL ALN and its sublanguages.

In a previous report we have investigates subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. This result depends on a characterization of subsumption through the existence of certain simulation relations on the graph associated with a terminology. In the present report we will use this characterization to show how the most specific concept and the least common subsumer can be computed in EL with cyclic definitions. In addition, we show that subsumption in EL (with or without cyclic definitions) remains polynomial even if one adds a certain restricted form of global role-value-maps to EL. In particular, this kind of role-value-maps can express transitivity of roles.

We investigate the impact that general concept inclusions and role-value maps have on the complexity and decidability of reasoning in the Description Logic FL₀. On the one hand, we give a more direct proof for ExpTimehardness of subsumption w.r.t. general concept inclusions in FL₀. 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.

Classical regular path queries (RPQs) can be too restrictive for some applications and answering such queries under approximate semantics to relax the query is desirable. While for answering regular path queries over graph databases under approximate semantics algorithms are available, such algorithms are scarce for the ontology-mediated setting. In this paper we extend an approach for answering RPQs over graph databases that uses weighted transducers to approximate paths from the query in two ways. The first extension is to answering approximate conjunctive 2-way regular path queries (C2RPQs) over graph databases and the second is to answering C2RPQs over ELH and DL-LiteR ontologies. We provide results on the computational complexity of the underlying reasoning problems and devise approximate query answering algorithms.

We adapt existing approaches for privacy-preserving publishing of linked data to a setting where the data are given as Description Logic (DL) ABoxes with possibly anonymised (formally: existentially quantified) individuals and the privacy policies are expressed using sets of concepts of the DL EL. We provide a chacterization of compliance of such ABoxes w.r.t. EL policies, and show how optimal compliant anonymisations of ABoxes that are noncompliant can be computed. This work extends previous work on privacypreserving ontology publishing, in which a very restricted form of ABoxes, called instance stores, had been considered, but restricts the attention to compliance. The approach developed here can easily be adapted to the problem of computing optimal repairs of quantified ABoxes. / This is an extended version of an article pulished in: Proceedings of the 19th International Semantic Web Conference (ISWC 2020), Springer LNCS

In recent work, we have shown how to compute compliant anonymizations of quantified ABoxes w.r.t. EL policies. In this setting, quantified ABoxes can be used to publish information about individuals, some of which are anonymized. The policy is given by concepts of the Description Logic (DL) EL, and compliance means that one cannot derive from the ABox that some non-anonymized individual is an instance of a policy concept. If one assumes that a possible attacker could have additional knowledge about some of the involved non-anonymized individuals, then compliance with a policy is not sufficient. One wants to ensure that the quantified ABox is safe in the sense that none of the secret instance information is revealed, even if the attacker has additional compliant knowledge. In the present paper, we show that safety can be decided in polynomial time, and that the unique optimal safe anonymization of a non-safe quantified ABox can be computed in exponential time, provided that the policy consists of a single EL concept. / This is an extended version of an article published in: Proceedings of the 36th ACM/SIGAPP Symposium on Applied Computing (SAC ’21), ACM

Impulsivität ist ein zentraler Aspekt der Persönlichkeit, welcher entlang eines Kontinuums in normaler bis devianter Ausprägung auftreten kann. So moduliert persönlichkeitsbezogene Impulsivität sowohl das Verhalten Gesunder, als auch, in ihrer extremen Ausprägung, klinisch relevante Verhaltensweisen. Signifikant überdurchschnittlich ausgeprägte Impulsivität gilt als charakteristisch für eine Vielzahl psychiatrischer Krankheitsbilder wie Abhängigkeitserkrankungen. Die differentiell-psychologische Forschung geht von einer Persönlichkeitseigenschaft aus, welche den verschiedenen Facetten des Phänomens Impulsivität zu Grunde liegt. Jedoch sind strukturelle Bildgebungsstudien an gesunden Probanden zu diesem Gegenstand noch immer rar und ihre Befunde sehr heterogen. Ziel der vorliegenden publikationsbasierten Dissertationsschrift ist es, einen Beitrag zu einem vertieften Verständnis zerebraler struktureller Korrelate persönlichkeitsbezogener Impulsivität bei Gesunden zu leisten. In drei empirischen Untersuchungen wurden Daten struktureller Magnetresonanztomographie bei Gesunden erhoben und jeweils auf korrelative Zusammenhänge mit persönlichkeitsbezogener Impulsivität getestet. Insgesamt zeigten die für multiple Testung korrigierten Ergebnisse dieser Arbeit negative Korrelationen zwischen persönlichkeitsbezogener Impulsivität und morphometrischen Maßen (kortikale Dicke, kortikales Volumen) des linken superior frontalen Kortex, des linken mittleren frontalen Kortex sowie des linken orbitofrontalen Kortex. Erstmalig wurden Zusammenhänge zwischen Impulsivität als spezifischer Persönlichkeitsfacette und der Kortexdicke an einer repräsentativen gesunden Stichprobe gezeigt. Insgesamt weisen die Ergebnisse auf eine zentrale Rolle linkshemisphärischer Strukturen im Bereich des präfrontalen Kortex für Impulsivität hin. / Impulsiveness is a pivotal aspect of personality comprising a continuum from normal to deviant occurrence. Trait impulsiveness modulates both behavior in healthy individuals and, in its extreme occurrence, even clinically relevant behavior. So, inhibition disorder is understood to be a characteristic in a number of mental health problems such as addiction disorders, personality disorders and attention deficit/ hyperactivity disorders. Research in the field of personality psychology views impulsiveness as a broad trait underlying all of the different facets of impulsiveness. The interest in the biological correlates of trait impulsiveness has stimulated a growing number of neuroscientific studies. However, non-clinical structural imaging studies on impulsiveness are still rare and their findings very heterogeneous. The present cumulative thesis aims to contribute to an advanced understanding of structural cerebral correlates of trait impulsiveness in healthy individuals. Within the scope of three empirical studies structural data were acquired by means of high-resolution magnetic resonance scans in healthy participants and tested respectively for correlations with trait impulsiveness. Summarizing these present studies’ findings, the results surviving a multiple comparison corrected threshold showed negative correlations between trait impulsiveness and morphometric measurements (cortical thickness, cortical volume) of the left superior frontal cortex, the left middle frontal cortex and the left orbitofrontal cortex. For the first time, associations between impulsiveness as a certain facet of personality and cortical thickness have been shown in a representative healthy sample. The present work provides further insight into structural cerebral substrates of trait impulsiveness considering novel methodological aspects. In summary, the results suggest structures of the left prefrontal cortex play a central role in impulsiveness.

In dieser Arbeit wird das Konzept der Scopes und auf großskalige metabolische Netzwerke angewendet. Scopes beschreiben die Synthesekapazität eines Netzwerkes, wenn dieses mit bestimmten Ausgangsstoffen versorgt wird. Dabei werden für definierte Ausgangsstoffe alle durch das Netzwerk synthetisierbaren Stoffe berechnet. In dieser Arbeit wird insbesondere das Referenznetzwerk der KEGG-Datenbank untersucht, welches Reaktionen unabhängig von ihrem Vorkommen in unterschiedlichen Organismen enthält. Es werden die Synthesekapazitäten systematisch für alle Einzelstoffe und für einige Stoffkombinationen errechnet und untersucht. Der Effekt von Kofaktoren wird analysiert. Desweiteren ist es möglich, Kombinationen von Ausgangsstoffen zu finden, aus denen wichtige Metabolite der Zelle produziert werden können. Somit kann der Nährstoffbedarf einer Zelle abgeschätzt werden. Im zweiten Teil wird eine Hierarchie der Scopes basierend auf Inklusionsrelationen zwischen diesen erstellt. Diese Hierarchie kann mit der chemischen Komposition der enthaltenen Stoffe, also mit deren chemischen Bausteinen, den Elementen oder Gruppen, in Verbindung gebracht werden. Dabei erhalten Scopes mit sehr häufigen Bausteinkombinationen eine hervorgehobene Rolle in der Hierarchie. Die Scopehierarchie kann mit der Autotrophie des Netzwerkes in Zusammenhang gebracht werden. Der dritte Teil beschäftigt sich mit möglichen Änderungen in der Topologie des Netzwerkes und deren Auswirkungen auf die Scopes. Es stellt sich heraus, dass die Synthesekapazitäten sich im allgemeinen sehr robust gegenüber solchen Veränderungen verhalten. Die Methodik ist im übrigen auch geeignet um Lücken im biochemischen Wissen aufzuspühren und dadurch die Kenntnisse über den Metabolismus zu erweitern. Außerdem zeigen die getätigten Analysen evolutionäre Ziele hinter der Konstruktion metabolischer Netzwerke auf. / In this work, the concept of scopes is introduced and applied to large scale metabolic networks. The scopes represent functional measures, describing the synthesizing capacity of a metabolic network if supplied with a predefined set of resources. For a given set of initial metabolites, the seed, all possible products are determined using the stoichiometric information of the network. Specifically, the organism independent KEGG reference network is analyzed. The first part of this work describes possible applications of the scopes, including the determination of the synthesizing capacities of different compounds and sets of compounds, the study of the effect of cofactors on the capacities of metabolic networks or the identification of possible nutrient sets required for the maintenance of a cell. In the second part, the scopes of different seed compounds are systematically analyzed and put in relation to one another. A hierarchy is generated representing the inclusion relations of the scopes. Interestingly, this hierarchy reflects the chemical composition, i.e. the chemical elements or chemical groups of the contained compounds. Scopes containing frequently used chemical elements or groups are represented by high degree nodes in this hierarchy. A subhierarchy of these characteristic scopes is described and brought in relation to the autotrophy of the network. In the third part, the effect of modifications in the topology of metabolic networks is analyzed. It turns out that the scopes are generally robust against the deletion of single and even multiple reactions. Also, the influence of limitations in the metabolic knowledge on the results is discussed and possibilities for improvements are indicated. The performed analyses reveal evolutionary objectives behind the construction of metabolic networks. In particular, hypotheses about design, autotrophy or robustness of metabolic networks can be inferred.