Concept Language With Number Restrictions and Fixpoints, and Its Relationship With mu-Calculus

. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue that, instead of choosing a single style of semantics, we achieve a better result by adopting a formalism allowing for different semantics to coexist. In order to demonstrate the feasibility of our proposal, we present a knowledge representation language with the above characteristics. The language is a powerful concept language where, besides the usual constructs for conjunction, disjunction, negation, and quantifiers, both qualified number restrictions, and recursive definitions are allowed. Notably, these features make our formalism one of the most powerful concept languages proposed in literature, in which the usual frame-based descriptions can be combined with definitions of data structures such as lists, directed acyclic graphs, streams, etc. We show that reasoning in our language is decidable, and we characte..

Investigation of the tradeoff between expressiveness and complexity in description logics with spatial operators

Le Logiche Descrittive sono una famiglia di formalismi molto espressivi per la rappresentazione della conoscenza. Questi formalismi sono stati investigati a fondo dalla comunit\ue0 scientifica, ma, nonostante questo grosso interesse, sono state definite poche Description Logics con operatori spaziali e tutte centrate sul Region Connection Calculus. Nella mia tesi considero tutti i pi\uf9 importanti formalismi di Qualitative Spatial Reasoning per mereologie, mereo-topologie e informazioni sulla direzione e studio alcune tecniche generali di ibridazione. Nella tesi presento un\u2019introduzione ai principali formalismi di Qualitative Spatial Reasoning e le principali famiglie di Description Logics. Nel mio lavoro, introduco anche le tecniche di ibridazione per estendere le Description Logics al ragionamento su conoscenza spaziale e presento il potere espressivo dei linguaggi ibridi ottenuti. Vengono presentati infine un risultato generale di para-decidibilit\ue0 per logiche descrittive estese da composition-based role axioms e l\u2019analisi del tradeoff tra espressivit\ue0 e propriet\ue0 computazionali delle logiche descrittive spaziali.Description Logics are a family of expressive Knowledge-Representation formalisms that have been deeply investigated. Nevertheless the few examples of DLs with spatial operators in the current literature are defined to include only the spatial reasoning capabilities corresponding to the Region Connection Calculus. In my thesis I consider all the most important Qualitative Spatial Reasoning formalisms for mereological, mereo-topological and directional information and investigate some general hybridization techniques. I will present a short overview of the main formalisms of Qualitative Spatial Reasoning and the principal families of DLs. I introduce the hybridization techniques to extend DLs to QSR and present the expressiveness of the resulting hybrid languages. I also present a general paradecidability result for undecidable languages equipped with composition-based role axioms and the tradeoff analysis of expressiveness and computational properties for the spatial DLs

Model and Proof Theory of Constructive ALC, Constructive Description Logics

Description logics (DLs) represent a widely studied logical formalism with a significant impact in the field of knowledge representation and the Semantic Web. However, they are equipped with a classical descriptive semantics that is characterised by a platonic notion of truth, being insufficiently expressive to deal with evolving and incomplete information, as from data streams or ongoing processes. Such partially determined and incomplete knowledge can be expressed by relying on a constructive semantics. This thesis investigates the model and proof theory of a constructive variant of the basic description logic ALC, called cALC. The semantic dimension of constructive DLs is investigated by replacing the classical binary truth interpretation of ALC with a constructive notion of truth. This semantic characterisation is crucial to represent applications with partial information adequately, and to achieve both consistency under abstraction as well as robustness under refinement, and on the other hand is compatible with the Curry-Howard isomorphism in order to form the cornerstone for a DL-based type theory. The proof theory of cALC is investigated by giving a sound and complete Hilbert-style axiomatisation, a Gentzen-style sequent calculus and a labelled tableau calculus showing finite model property and decidability. Moreover, cALC can be strengthened towards normal intuitionistic modal logics and classical ALC in terms of sound and complete extensions and hereby forms a starting point for the systematic investigation of a constructive correspondence theory.Beschreibungslogiken (BLen) stellen einen vieluntersuchten logischen Formalismus dar, der den Bereich der Wissensrepräsentation und das Semantic Web signifikant geprägt hat. Allerdings basieren BLen meist auf einer klassischen deskriptiven Semantik, die gekennzeichnet ist durch einen idealisierten Wahrheitsbegriff nach Platons Ideenlehre, weshalb diese unzureichend ausdrucksstark sind, um in Entwicklung befindliches und unvollständiges Wissen zu repräsentieren, wie es beispielsweise durch Datenströme oder fortlaufende Prozesse generiert wird. Derartiges partiell festgelegtes und unvollständiges Wissen lässt sich auf der Basis einer konstruktiven Semantik ausdrücken. Diese Arbeit untersucht die Model- und Beweistheorie einer konstruktiven Variante der Basis-BL ALC, die im Folgenden als cALC bezeichnet wird. Die Semantik dieser konstruktiven Beschreibungslogik resultiert daraus, die traditionelle zweiwertige Interpretation logischer Aussagen des Systems ALC durch einen konstruktiven Wahrheitsbegriff zu ersetzen. Eine derartige Interpretation ist die Voraussetzung dafür, um einerseits Anwendungen mit partiellem Wissen angemessen zu repräsentieren, und sowohl die Konsistenz logischer Aussagen unter Abstraktion als auch ihre Robustheit unter Verfeinerung zu gewährleisten, und andererseits um den Grundstein für eine Beschreibungslogik-basierte Typentheorie gemäß dem Curry-Howard Isomorphismus zu legen. Die Ergebnisse der Untersuchung der Beweistheorie von cALC umfassen eine vollständige und korrekte Hilbert Axiomatisierung, einen Gentzen Sequenzenkalkül, und ein semantisches Tableaukalkül, sowie Beweise zur endlichen Modelleigenschaft und Entscheidbarkeit. Darüber hinaus kann cALC zu normaler intuitionistischer Modallogik und klassischem ALC durch vollständige und korrekte Erweiterungen ausgebaut werden, und bildet damit einen Startpunkt für die systematische Untersuchung einer konstruktiven Korrespondenztheorie