• Publications
  • Influence
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
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
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
ConGolog, a concurrent programming language based on the situation calculus
TLDR
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. 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
Linear Temporal Logic and Linear Dynamic Logic on Finite Traces
TLDR
This paper shows that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and proposes a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite trace. Expand
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
Containment of Conjunctive Regular Path Queries with Inverse
TLDR
This paper presents a novel technique to check containment of queries in this class, based on the use of two-way flnite automata, and shows the power of three-way automata in dealing with the inverse operator and with the variables in the queries. Expand
Ontologies and Databases: The DL-Lite Approach
TLDR
This article addresses the problem of accessing relational data sources through an ontology, and presents a solution to the notorious impedance mismatch between the abstract objects in the ontology and the values appearing in data sources. Expand
An Incremental Interpreter for High-Level Programs with Sensing
TLDR
A new incremental way of interpreting such high-level programs and a new high- level language construct are proposed, which together allow much more control to be exercised over when actions can be executed. Expand
...
1
2
3
4
5
...