Now showing items 587-606 of 1009

  • OBDA Beyond Relational DBs: A Study for MongoDB 

    Botoeva E; Calvanese D; Cogrel B; Rezk M; Xiao G (CEUR Workshop Proceedings, 2016)
    The database landscape has been significantly diversified during the last decade, resulting in the emergence of a variety of non-relational (also called NoSQL) databases, e.g., XML and JSON-document databases, key-value ...
  • OBDA for Log Extraction in Process Mining 

    Calvanese D; Kalayci TE; Montali M; Santoso A (Springer, 2017)
    Process mining is an emerging area that synergically combines model-based and data-oriented analysis techniques to obtain useful insights on how business processes are executed within an organization. Through process mining, ...
  • OBDA Over Non-Relational Databases 

    Botoeva E; Calvanese D; Cogrel B; Rezk M; Xiao G (CEUR Workshop Proceedings, 2016)
    The database landscape has been significantly diversified during the last decade, resulting in the emergence of a variety of non-relational (also called NoSQL) databases, e.g., XML and JSON-document databases, key-value ...
  • OBDA with the Ontop Framework 

    Calvanese D; Cogrel B; Guzel Kalayci E; Komla Ebri S; Kontchakov R; Lanti D; Rezk M; Rodriguez-Muro M; Xiao G (Curran, 2015)
    Ontology-based data access (OBDA) has become a popular paradigm for accessing data stored in legacy sources using Semantic Web technologies. In the OBDA setting, users access the data through a conceptual layer, which ...
  • Object-Centric Behavioral Constraints: Integrating Data and Declarative Process Modelling 

    Artale A; Montali M; Tritini S; van der Aalst WMP (CEUR-WS.org, 2017)
  • Observation and abstract behaviour in specification and implementation of state-based systems 

    Pahl C (British Computer Society, 2001)
    Classical algebraic specification is an accepted framework for specification. A criticism which applies is the fact that it is functional, not based on a notion of state as most software development and implementation ...
  • OCL-Lite: A decidable (yet expressive) fragment of OCL 

    Queralt A; Artale A; Calvanese D; Teniente E (CEUR-WS.org, 2012)
    UML has become a de facto standard in conceptual modeling. Class diagrams in UML allow one to model the data in the domain of interest by specifying a set of graphical constraints. However, in most cases one needs to provide ...
  • On first-order μ-calculus over situation calculus action theories 

    Calvanese D; De Giacomo G; Montali M; Patrizi F (AAAI Press, 2016)
    In this paper we study verification of situation calculus action theories against first-order mu-calculus with quantification across situations. Specifically, we consider muLa and muLp, the two variants of mu-calculus ...
  • On how often code is cloned across repositories 

    Schwarz N; Lungu M; Robbes R (IEEE Computer Society, 2012)
    Detecting code duplication in large code bases, or even across project boundaries, is problematic due to the massive amount of data involved. Large-scale clone detection also opens new challenges beyond asking for the ...
  • On Temporal Regulations and Commitment Protocols 

    Marengo, E; Baldoni, M; Baroglio, C (AAAI Press, 2011)
    The proposal of Elisa Marengo's thesis is to extend commitment protocols in order to (i) allow for expressing commitments to temporal regulations, and (ii) to supply a tool for expressing laws, conventions and the like, ...
  • On the Cognitive and Logical Role of Image Schemas in Computational Conceptual Blending 

    Hedblom M; Kutz O; Neuhaus F (CEUR-WS.org, 2014)
    In cognitive science, image schemas are identified as the fundamental patterns for the cognition of objects, which are perceived, conceptualised and manipulated in space and time. In this paper, we discuss a role for image ...
  • On the decidability status of fuzzy ALC with general concept inclusions 

    Baader, F; Borgwardt, S; Penaloza, R (Springer Verlag (Germany), 2015)
    The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp ...
  • On the efficient construction of multislices from recurrences 

    Kasperovics, R; Böhlen, MH; Gamper, J (Springer, 2010)
    Recurrences are defined as sets of time instants associated with events and they are present in many application domains, including public transport schedules and personal calendars. Because of their large size, recurrences ...
  • On the Impact of Refactoring Operations on Code Quality Metrics 

    Chaparro, O; Bavota, G; Marcus, A; Di Penta, M (IEEE, 2014)
    Refactorings are behavior-preserving source code transformations. While tool support exists for (semi)automatically identifying refactoring solutions, applying or not a recommended refactoring is usually ...
  • On the Influence of User Characteristics on Music Recommendation Algorithms 

    Schedl M; Hauger D; Farrahi K; Tkalcic M (Springer, 2015)
    We investigate a range of music recommendation algorithm combinations, score aggregation functions, normalization techniques, and late fusion techniques on approximately 200 million listening events collected through ...
  • On the optimal ordering of maps and selections under factorization 

    Neumann, T; Helmer, S; Moerkotte, G (IEEE, 2005)
    We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions involving expensive UDF calls can be factored ...
  • On the Transition to an Open Source Solution for Desktop Office Automation. 

    Rossi B; Russo B; Zuliani P; Succi G (Springer, 2005)
    There are many claims about the benefits of Open Source Software (OSS). However, these claims are seldom supported by empirical evidence, while on the other hand there are several impediment factors which might overcome ...
  • On the Undecidability of Fuzzy Description Logics with GCIs and Product t-norm 

    Baader, F; Penaloza, R (Springer-Verlag, 2011)
    The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp ...
  • On the undecidability of the situation calculus extended with description logic ontologies 

    Calvanese D; De Giacomo G; Soutchanski M (AAAI Press, 2015)
    In this paper we investigate situation calculus action theories extended with ontologies, expressed as description logics TBoxes that act as state constraints. We show that this combination, while natural and desirable, ...
  • On understanding how developers use the Spotter search tool 

    Kubelka J; Bergel A; Chis A; Girba T; Reichhart S; Robbes R; Syrel A (Institute of Electrical and Electronics Engineers Inc., 2015)
    Analyzing how software engineers use the Integrated Development Environment (IDE) is essential to better understanding how engineers carry out their daily tasks. SPOTTER is a code search engine for the Pharo programming ...