• Publications
  • Influence
The Description Logic Handbook: Theory, Implementation, and Applications
TLDR
This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications. Expand
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TLDR
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. Expand
The Description Logic Handbook
This introduction presents the main motivations for the development of Description Logics (DLs) as a formalism for representing knowledge, as well as some important basic notions underlying allExpand
Linking Data to Ontologies
TLDR
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. Expand
The DL-Lite Family and Relations
TLDR
This article carries out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes, by adding the Boolean connectives and number restrictions to concept constructs and adopting or dropping the unique name assumption. Expand
Reasoning on UML class diagrams
TLDR
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. Expand
DL-Lite: Tractable Description Logics for Ontologies
TLDR
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Ontop: Answering SPARQL queries over relational databases
We present Ontop, an open-source Ontology-Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided inExpand
Data Complexity of Query Answering in Description Logics
TLDR
The Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query answering through standard database technology, and are the first description Logics specifically tailored for effective query answering over very large ABoxes. Expand
...
1
2
3
4
5
...