Giuseppe De Giacomo

TL;DR: It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.

TL;DR: This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem.

TL;DR: This work considers UML class diagrams, which are one of the most important components of UML, and addresses the problem of reasoning on such diagrams, using several results developed in the field of Knowledge Representation and Reasoning regarding Description Logics (DLs), a family of logics that admit decidable reasoning procedures.

TL;DR: A formal definition in the situation calculus of such a programming language is presented and illustrated with some examples that includes facilities for prioritizing the execution of concurrent processes, interrupting the execution when certain conditions become true, and dealing with exogenous actions.

TL;DR: In this article, the authors study the data complexity of answering conjunctive queries over Description Logic knowledge bases and show that the Description Logics of the DL-Lite family are the maximal logics that allow query answering over very large ABoxes.