Search

The Associazione Medici Diabetologi (AMD) collects and manages one of the largest worldwide-available collections of diabetic patient records, also known as the AMD database. This paper presents the initial results of an ongoing project whose focus is the application of Artificial Intelligence and Machine Learning techniques for conceptualizing, cleaning, and analyzing such an important and valuable dataset, with the goal of providing predictive insights to better support diabetologists in their diagnostic and therapeutic choices., Comment: The work has been presented at the conference Ital-IA 2022 (https://www.ital-ia2022.it/)

Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to find a query over the ontology whose certain answers coincide with the tuples in the given dataset. We refer to such a query as a characterization of the dataset with respect to the OBDM system. Our first contribution is to propose approximations of perfect characterizations in terms of recall (complete characterizations) and precision (sound characterizations). A second contribution is to present a thorough complexity analysis of three computational problems, namely verification (check whether a given query is a perfect, or an approximated characterization of a given dataset), existence (check whether a perfect, or a best approximated characterization of a given dataset exists), and computation (compute a perfect, or best approximated characterization of a given dataset)., Comment: A more compact version of this paper will be published at the proceedings of the 30th ACM International Conference on Information and Knowledge Management. The associated DOI is: https://doi.org/10.1145/3459637.34824661

A Data Ecosystem offers a keystone-player or alliance-driven infrastructure that enables the interaction of different stakeholders and the resolution of interoperability issues among shared data. However, despite years of research in data governance and management, trustability is still affected by the absence of transparent and traceable data-driven pipelines. In this work, we focus on requirements and challenges that data ecosystems face when ensuring data transparency. Requirements are derived from the data and organizational management, as well as from broader legal and ethical considerations. We propose a novel knowledge-driven data ecosystem architecture, providing the pillars for satisfying the analyzed requirements. We illustrate the potential of our proposal in a real-world scenario. Lastly, we discuss and rate the potential of the proposed architecture in the fulfillment of these requirements.

The study of node selection query languages for (finite) trees has been a major topic in the recent research on query languages for Web documents. On one hand, there has been an extensive study of XPath and its various extensions. On the other hand, query languages based on classical logics, such as first-order logic (FO) or Monadic Second-Order Logic (MSO), have been considered. Results in this area typically relate an XPath-based language to a classical logic. What has yet to emerge is an XPath-related language that is as expressive as MSO, and at the same time enjoys the computational properties of XPath, which are linear time query evaluation and exponential time query-containment test. In this paper we propose muXPath, which is the alternation-free fragment of XPath extended with fixpoint operators. Using two-way alternating automata, we show that this language does combine desired expressiveness and computational properties, placing it as an attractive candidate for the definite node-selection query language for trees.

DFU, Volume 5, Data Exchange, Information, and Streams, Complete Volume

Frontmatter, Table of Contents, Preface

Frontmatter, Table of Contents, Preface

DFU, Volume 5, Data Exchange, Information, and Streams, Complete Volume

Recent papers address the issue of updating the instance level of knowledge bases expressed in Description Logic following a model-based approach. One of the outcomes of these papers is that the result of updating a knowledge base K is generally not expressible in the Description Logic used to express K. In this paper we introduce a formula-based approach to this problem, by revisiting some research work on formula-based updates developed in the '80s, in particular the WIDTIO (When In Doubt, Throw It Out) approach. We show that our operator enjoys desirable properties, including that both insertions and deletions according to such operator can be expressed in the DL used for the original KB. Also, we present polynomial time algorithms for the evolution of the instance level knowledge bases expressed in the most expressive Description Logics of the DL-lite family.

In data management, and in particular in data integration, data exchange, query optimization, and data privacy, the notion of view plays a central role. In several contexts, such as data integration, data mashups, and data warehousing, the need arises of designing views starting from a set of known correspondences between queries over different schemas. In this paper we deal with the issue of automating such a design process. We call this novel problem "view synthesis from schema mappings": given a set of schema mappings, each relating a query over a source schema to a query over a target schema, automatically synthesize for each source a view over the target schema in such a way that for each mapping, the query over the source is a rewriting of the query over the target wrt the synthesized views. We study view synthesis from schema mappings both in the relational setting, where queries and views are (unions of) conjunctive queries, and in the semistructured data setting, where queries and views are (two-way) regular path queries, as well as unions of conjunctions thereof. We provide techniques and complexity upper bounds for each of these cases.

Query containment and query answering are two important computational tasks in databases. While query answering amounts to compute the result of a query over a database, query containment is the problem of checking whether for every database, the result of one query is a subset of the result of another query. In this paper, we deal with unions of conjunctive queries, and we address query containment and query answering under Description Logic constraints. Every such constraint is essentially an inclusion dependencies between concepts and relations, and their expressive power is due to the possibility of using complex expressions, e.g., intersection and difference of relations, special forms of quantification, regular expressions over binary relations, in the specification of the dependencies. These types of constraints capture a great variety of data models, including the relational, the entity-relationship, and the object-oriented model, all extended with various forms of constraints, and also the basic features of the ontology languages used in the context of the Semantic Web. We present the following results on both query containment and query answering. We provide a method for query containment under Description Logic constraints, thus showing that the problem is decidable, and analyze its computational complexity. We prove that query containment is undecidable in the case where we allow inequalities in the right-hand side query, even for very simple constraints and queries. We show that query answering under Description Logic constraints can be reduced to query containment, and illustrate how such a reduction provides upper bound results with respect to both combined and data complexity.

The International Workshop on Description Logics was held in Linköping Sweden from July to August. It was an a affiliate event with the Sixteenth International Joint Conference on Articial Intelligence IJCAI Stockholm July 31 - August 6 and with the Sixth International Workshop on Knowledge Representation meets Databases KRDB Linköoping July 29-30. The workshop was organized in sessions on theoretical advances in de scription logics (2 sessions), applications of description logics (2 sessions), description logic systems (2 sessions) and extensions of description logics (1 session). Further there was a joint session with the Sixth International Workshop on Knowledge Representation Meets Databases. There were two invited talks Natasha Alechina gave a tutorial on logics for semi-structured data Robert MacGregor and Deborah McGuinness gave a presentation on DARPAs High Performance Knowledge Base project. The workshop was sponsored by the Swedish Research Council for Engineering Sciences TFR Telefonaktiebolaget LM Ericssons Stiftelse for främjande av elektroteknisk forskning, Linköpings kommun, Erda AB andthe Laboratory for Intelligent Information Systems, Linköpings universitet.Thanks go also to Lotta Nissen Yelena Turetskaya and a number of studentsfor their contribution to the organization.

The International Workshop on Description Logics was held in Linköping Sweden from July to August. It was an a affiliate event with the Sixteenth International Joint Conference on Articial Intelligence IJCAI Stockholm July 31 - August 6 and with the Sixth International Workshop on Knowledge Representation meets Databases KRDB Linköoping July 29-30. The workshop was organized in sessions on theoretical advances in de scription logics (2 sessions), applications of description logics (2 sessions), description logic systems (2 sessions) and extensions of description logics (1 session). Further there was a joint session with the Sixth International Workshop on Knowledge Representation Meets Databases. There were two invited talks Natasha Alechina gave a tutorial on logics for semi-structured data Robert MacGregor and Deborah McGuinness gave a presentation on DARPAs High Performance Knowledge Base project. The workshop was sponsored by the Swedish Research Council for Engineering Sciences TFR Telefonaktiebolaget LM Ericssons Stiftelse for främjande av elektroteknisk forskning, Linköpings kommun, Erda AB andthe Laboratory for Intelligent Information Systems, Linköpings universitet.Thanks go also to Lotta Nissen Yelena Turetskaya and a number of studentsfor their contribution to the organization.

The International Workshop on Description Logics was held in Linköping Sweden from July to August. It was an a affiliate event with the Sixteenth International Joint Conference on Articial Intelligence IJCAI Stockholm July 31 - August 6 and with the Sixth International Workshop on Knowledge Representation meets Databases KRDB Linköoping July 29-30. The workshop was organized in sessions on theoretical advances in de scription logics (2 sessions), applications of description logics (2 sessions), description logic systems (2 sessions) and extensions of description logics (1 session). Further there was a joint session with the Sixth International Workshop on Knowledge Representation Meets Databases. There were two invited talks Natasha Alechina gave a tutorial on logics for semi-structured data Robert MacGregor and Deborah McGuinness gave a presentation on DARPAs High Performance Knowledge Base project. The workshop was sponsored by the Swedish Research Council for Engineering Sciences TFR Telefonaktiebolaget LM Ericssons Stiftelse for främjande av elektroteknisk forskning, Linköpings kommun, Erda AB andthe Laboratory for Intelligent Information Systems, Linköpings universitet.Thanks go also to Lotta Nissen Yelena Turetskaya and a number of studentsfor their contribution to the organization.

The International Workshop on Description Logics was held in Linköping Sweden from July to August. It was an a affiliate event with the Sixteenth International Joint Conference on Articial Intelligence IJCAI Stockholm July 31 - August 6 and with the Sixth International Workshop on Knowledge Representation meets Databases KRDB Linköoping July 29-30. The workshop was organized in sessions on theoretical advances in de scription logics (2 sessions), applications of description logics (2 sessions), description logic systems (2 sessions) and extensions of description logics (1 session). Further there was a joint session with the Sixth International Workshop on Knowledge Representation Meets Databases. There were two invited talks Natasha Alechina gave a tutorial on logics for semi-structured data Robert MacGregor and Deborah McGuinness gave a presentation on DARPAs High Performance Knowledge Base project. The workshop was sponsored by the Swedish Research Council for Engineering Sciences TFR Telefonaktiebolaget LM Ericssons Stiftelse for främjande av elektroteknisk forskning, Linköpings kommun, Erda AB andthe Laboratory for Intelligent Information Systems, Linköpings universitet.Thanks go also to Lotta Nissen Yelena Turetskaya and a number of studentsfor their contribution to the organization.

The International Workshop on Description Logics was held in Linköping Sweden from July to August. It was an a affiliate event with the Sixteenth International Joint Conference on Articial Intelligence IJCAI Stockholm July 31 - August 6 and with the Sixth International Workshop on Knowledge Representation meets Databases KRDB Linköoping July 29-30. The workshop was organized in sessions on theoretical advances in de scription logics (2 sessions), applications of description logics (2 sessions), description logic systems (2 sessions) and extensions of description logics (1 session). Further there was a joint session with the Sixth International Workshop on Knowledge Representation Meets Databases. There were two invited talks Natasha Alechina gave a tutorial on logics for semi-structured data Robert MacGregor and Deborah McGuinness gave a presentation on DARPAs High Performance Knowledge Base project. The workshop was sponsored by the Swedish Research Council for Engineering Sciences TFR Telefonaktiebolaget LM Ericssons Stiftelse for främjande av elektroteknisk forskning, Linköpings kommun, Erda AB andthe Laboratory for Intelligent Information Systems, Linköpings universitet.Thanks go also to Lotta Nissen Yelena Turetskaya and a number of studentsfor their contribution to the organization.