Now showing items 1-20 of 137

    • 2ATAs make DLs easy 

      Calvanese D; De Giacomo G; Lenzerini M (CEUR-WS.org, 2002)
      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 ...
    • Adding context to Knowledge and Action Bases 

      Calvanese D; Ceylan I; Montali M; Santoso A (arXiv.org e-Print archive, 2014)
      Knowledge and Action Bases (KABs) have been recently proposed as a formal framework to capture the dynamics of systems which manipulate Description Logic (DL) Knowledge Bases (KBs) through action execution. In this work, ...
    • Answering EL Queries in the Presence of Preferences 

      Ceylan; Lukasiewicz T; Peñaloza R (CEUR, 2015)
    • Automated activity recognition in clinical documents 

      Thorne C; Montali M; Calvanese D; Cardillo E; Eccher C (Asian Federation of Natural Language Processing / ACL, 2013)
      We describe a first experiment on the identification and extraction of computer-interpretable guideline (CIG) components (activities, actors and consumed artifacts) from clinical documents, based on clinical entity recognition ...
    • Automated Reasoning on Conceptual Schemas (Dagstuhl Seminar 13211) 

      Calvanese D; Hartmann S; Teniente E (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013)
      This report documents the outcomes of the Dagstuhl Seminar 13211 "Automated Reasoning on Conceptual Schemas". The quality of an information system is largely determined early in the development cycle, i.e., during requirements ...
    • Basic Description Logics 

      Baader F; Nutt W (Cambridge University Press, 2003)
      This chapter provides an introduction to Description Logics as a formal language for representing knowledge and reasoning about it. It first gives a short overview of the ideas underlying Description Logics. Then it ...
    • Best Service Synthesis in the Weighted Roman Model 

      Calvanese D; Santoso A (CEUR-WS.org, 2012)
      This paper presents an extension of a framework for synthesizing a composition of services, named Roman Model, such that it is able to model the best service composition synthesis problem. In such extension, which we call ...
    • Beyond OWL 2 QL in OBDA: Rewritings and approximations 

      Botoeva E; Calvanese D; Santarelli V; Fabio Savo D; Solimando A; Xiao G (AAAI, 2016)
      Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings. DL-LiteR, which is the logic underpinning the ...
    • Blocking Automata for PSPACE DLs 

      Baader F; Hladik J; Peñaloza R (CEUR, 2007)
      In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as concept satisfiability. Whereas tableau-based ...
    • Capturing model-based ontology evolution at the instance level: The case of DL-Lite 

      Kharlamov E; Zheleznyakov D; Calvanese D (2013)
      Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) has gained a lot of attention lately. Recent studies on the topic have mostly focused on so-called model-based approaches (MBAs), where the evolution ...
    • Circumscribing DL-Lite 

      Botoeva E; Calvanese D (IOS Press, 2012)
      Classical logics (and hence Description Logics) are monotonic: the set of conclusions increases monotonically with the set of premises. Instead, common-sense reasoning is characterized as non-monotonic: new information can ...
    • The complexity of explaining negative query answers in DL-Lite 

      Calvanese D; Ortiz M; Simkus M; Stefanoni G (AAAI Press, 2012)
      In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research has focused on the explanation of both TBox reasoning ...
    • Computing Solutions in OWL 2 QL Knowledge Base Exchange 

      Arenas M; Botoeva E; Calvanese D; Ryzhikov V (CEUR Electronic Workshop Proceedings, 2013)
      The problem of exchanging knowledge bases from a source signature to a target signature connected through a mapping has attracted attention recently in knowledge representation. In this paper, we study this problem for ...
    • Conceptual Schema Transformation in Ontology-based Data Access (Extended Abstract) 

      Calvanese D; Kalayci TE; Montali M; Santoso A; van der Aalst WMP (CEUR-WS, 2018)
    • Cost-Driven Ontology-Based Data Access 

      Lanti D; Xiao G; Calvanese D (Springer, 2017)
      SPARQL query answering in ontology-based data access (OBDA) is carried out by translating into SQL queries over the data source. Standard translation techniques try to transform the user query into a union of conjunctive ...
    • Data complexity of query answering in description logics 

      Calvanese D; De Giacomo G; Lembo D; Lenzerini M; Rosati R (2013)
      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 ...
    • Data complexity of query answering in description logics (Extended abstract) 

      Calvanese D; De Giacomo G; Lembo D; Lenzerini M; Rosati R (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 ...
    • Dealing with Inconsistencies due to Class Disjointness in SPARQL Update 

      Ahmeti A; Calvanese D; Polleres A; Savenkov V (CEUR-WS, 2015)
      The problem of updating ontologies has received increased attention in recent years. In the approaches proposed so far, either the update language is restricted to (sets of) atomic updates, or, where the full SPARQL Update ...
    • Description logic based dynamic systems: Modeling, verification, and synthesis 

      Calvanese D; Montali M; Patrizi F; De Giacomo G (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 ...
    • Description logic Knowledge and Action Bases 

      Bagheri Hariri B; Calvanese D; Montali M; De Giacomo G; De Masellis R; Felli P ({AAAI} Press/The {MIT} Press, 2013)
      Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions ...