Now showing items 1-5 of 5

    • Beth Definability in Expressive Description Logics 

      Cate B; Franconi E; Seylan I (2013)
      The Beth definability property, a well-known property from classical logic, is investigated in the context of description logics: if a general L-TBox implicitly defines an L-concept in terms of a given signature, where L ...
    • Exact Query Reformulation over Databases with First-order and Description Logics Ontologies 

      Franconi E; Kerhet V; Ngo TPN (2013)
      We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent ...
    • Lossless Selection Views under Conditional Domain Constraints 

      Feinerer I; Franconi E; Guagliardo P (2015)
      A set of views defined by selection queries splits a database relation into sub-relations, each containing a subset of the original rows. This decomposition into horizontal fragments is lossless when the initial relation ...
    • OCL_FO: first-order expressive OCL constraints for efficient integrity checking 

      Franconi E; Mosca A; Oriol X; Rull G; Teniente E (2019)
      OCL is the standard language for defining constraints in UML class diagrams. Unfortunately, as we show in this paper, full OCL is so expressive that it is not possible to check general OCL constraints efficiently. In ...
    • Query Answering with DBoxes is Hard 

      Franconi E; Ibánez-García YA; Seylan I (2011)
      Data in description logic knowledge bases is stored in the form of an ABox. ABoxes are often confusing for developers coming from relational databases because an ABox, in contrast to a database instance, provides an ...