Now showing items 1-10 of 11
Data complexity of query answering in description logics (Extended abstract)
(AAAI Press, 2015)
We study the data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FO-rewritability and the ...
Regular open APIs
(AAAI Press, 2016)
Open APIs are software intermediaries that make it possible for application programs to interact with data and processes, which can both be viewed as forms of services. In many scenarios, when one wants to obtain or publish ...
Rewrite and Conquer: Dealing with Integrity Constraints in Data Integration
The work "Data Integration under Integrity Constraints'', published at the CAiSE~2002 Conference, proposes a rewriting technique for answering queries in data integration systems, when the global schema contains the classical ...
A foundational vision of e-services
In this paper we propose a foundational vision of e-Services, in which we distinguish between the external behavior of an e-Service as seen by clients, and the internal behavior as seen by a deployed application running ...
Query Processing under GLAV Mappings for Relational and Graph Databases
Schema mappings establish a correspondence between data stored in two databases, called source and target respectively. Query processing under schema mappings has been investigated extensively in the two cases where each ...
View-based query answering in description logics: Semantics and complexity
View-based query answering is the problem of answering a query based only on the precomputed answers to a set of views. While this problem has been widely investigated in databases, it is largely unexplored in the context ...
Data complexity of query answering in description logics
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) knowledge bases constituted by an ABox and a TBox. In particular, we are interested in characterizing the FOL-rewritability ...
2ATAs make DLs easy
In this paper we demonstrate that two-way alternating automata on infinite trees (2ATAs) provide a very elegant and effective formal tool for addressing reasoning in expressive DLs. Indeed, the encoding of a DL concept (to ...
Ontology-Based Data Access and Integration
A formal framework for reasoning on UML class diagrams
In this paper we formalize UML class diagrams in terms of a logic belonging to Description Logics, which are subsets of First-Order Logic that have been thoroughly investigated in Knowledge Representation. The logic we ...