Now showing items 1-20 of 22

    • Actions and programs over description logic ontologies 

      Calvanese, D; Lenzerini, M; Riccardo, R; De Giacomo, G (Bozen-Bolzano University Press, 2007)
      We aim at representing and reasoning about actions and (high level) programs over ontologies expressed in Description Logics. This is a critical issue that has resisted good solutions for a long time. In particular, while ...
    • Adding Weight to DL-Lite 

      Artale, A; Calvanese, D; Kontchakov, R; Zakharyaschev, M (CEUR-WS.org, 2009)
      In this paper we extend the logic DL-LiteNbool and its fragments with (i) role inclusions, (ii) qualified number restrictions and (iii) role disjointness, symmetry, asymmetry, reflexivity and irreflexivity constraints. We ...
    • Aggregate Queries over Ontologies 

      Calvanese, D; Kharlamvov, E; Nutt, W; Thorne, C (ACM, 2008)
      Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for aggregate queries over ontologies. In this ...
    • Complexity of reasoning over entity-relationship models? 

      Artale, A; Calvanese, D; Kontchakov, R; Ryzhikov, V; Zakharyaschev, M (Bozen-Bolzano University Press, 2007)
      We investigate the complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which include different combinations of the constructors for ISA between concepts and relationships, ...
    • Conjunctive Query Answering with Finitely Many Truth Degrees 

      Borgwardt, S; Mailis, TP; Peñaloza, R; Turhan, A (CEUR, 2015)
    • The DL-Lite Family and Relations 

      Artale, A; Calvanese, D; Kontchakov, R; Zakharyaschev, M (Association for the Advancement of Artificial Intelligence / AI Access Foundation, 2009)
      The recently introduced series of description logics under the common moniker `DL-Lite' has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, ...
    • DL-Lite in the light of first-order logic 

      Artale, A; Calvanese, D; Kontchakov, R; Zakharyaschev, M (AAAI Press, 2007)
      The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large amounts of data, is posing challenging ...
    • Dynamic Bayesian Description Logics 

      Ceylan, II; Peñaloza, R (CEUR, 2015)
    • Evolution of DL-Lite Knowledge Bases 

      Calvanese, D; Kharlamov, E; Nutt, W; Zheleznyakov, D (Springer, 2010)
      We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed ...
    • Exchanging Description Logic Knowledge Bases 

      Arenas, M; Botoeva, E; Calvanese, D; Ryzhikov, V; Sherkhonov, E (AAAI Press, 2012)
      In this paper, we study the problem of exchanging knowledge between a source and a target knowledge base (KB), connected through mappings. Differently from the traditional database exchange setting, which considers only ...
    • Expressing DL-Lite ontologies with Controlled English 

      Bernardi, R; Calvanese, D; Thorne, C (Bozen-Bolzano University Press, 2007)
      In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expressing ontologies formalized in Description ...
    • Full Satisfiability of UML Class Diagrams 

      Artale, A; Calvanese, D; Ibanez-Garcia, A (Springer, 2010)
      UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expressed by UCDs one can exploit automated ...
    • A 'historical case' of ontology-based data access 

      Calvanese, D; Mosca, A; Remesal, J; Rezk, M; Rull, G (IEEE, 2015)
      Historical research has steadily been adopting semantic technologies to tackle several recent problems in the field, such as making explicit the semantics contained in the historical sources, formalising them and linking ...
    • Interval temporal description logics 

      Artale, A; Kontchakov, R; Ryzhikov, V; Zakharyaschev, M (CEUR, 2015)
      We design interval temporal description logics based on the Horn fragment of DL-Lite extended with the Allen temporal operators. We identify two tractable fragments that are expressive enough to represent constraints arising ...
    • Mastro-i: Efficient integration of relational data through DL ontologies 

      Calvanese, D; Lembo, D; Lenzerini, M; Poggi, A; Rosati, R; De Giacomo, G (Bozen-Bolzano University Press, 2007)
      The goal of data integration is to provide a uniform access to a set of heterogeneous data sources, freeing the user from the knowledge about where the data are, how they are stored, and how they can be accessed. One of ...
    • A proof theory for DL-Lite 

      Calvanese, D; Kharlamov, E; Nutt, W (Bozen-Bolzano University Press, 2007)
      In this work we propose an alternative approach to inference in DL-Lite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a calculus for EHL and prove its soundness and ...
    • Query rewriting in DL-Lite HN horn 

      Botoeva, E; Artale, A; Calvanese, D (CEUR-WS.org, 2010)
      In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite (HN) horn, a logic from the extended DL-Lite family that contains horn concept inclusions and number ...
    • Reasoning over Extended ER Models 

      Artale, A; Calvanese, D; Kontchakov, R; Ryzhikov, V; Zakharyaschev, M (Springer, 2007)
      We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs: isa between entities and relationships, disjointness ...
    • Report on PODS 2015 

      Calvanese, D (2015)
    • Representability in DL-LiteR Knowledge Base Exchange 

      Arenas, M; Botoeva, E; Calvanese, D; Ryzhikov, V; Sherkhonov, E (CEUR, 2012)
      Knowledge base exchange can be considered as a generalization of data exchange in which the aim is to exchange between a source and a target connected through mappings, not only explicit knowledge, i.e., data, but also ...