Metamodeling and metaquerying in OWL 2 QL

OWL 2 QL is a standard profile of the OWL 2 ontology language, specifically tailored to Ontology-Based Data Management. Inspired by recent work on higher-order Description Logics, in this paper we present a new semantics for OWL 2 QL ontologies, called Metamodeling Semantics (MS), and show that, in contrast to the official Direct Semantics (DS) for OWL 2, it allows exploiting the metamodeling capabilities natively offered by the OWL 2 punning. We then extend unions of conjunctive queries with both metavariables, and the possibility of using TBox atoms, with the purpose of expressing meaningful metalevel queries. We first show that under MS both satisfiability checking and answering queries including only ABox atoms, have the same complexity as under DS. Second, we investigate the problem of answering general metaqueries, and single out a new source of complexity coming from the combined presence of a specific type of incompleteness in the ontology, and of TBox axioms among the query atoms. Then we focus on a specific class of ontologies, called TBox-complete, where there is no incompleteness in the TBox axioms, and show that general metaquery answering in this case has again the same complexity as under DS. Finally, we move to general ontologies and show that answering general metaqueries is coNP-complete with respect to ontology complexity, Π2p-complete with respect to combined complexity, and remains AC0 with respect to ABox complexity

Panel on “Past and future of computer science theory”

The twenty-ninth edition of the SEBD (Italian Symposium on Advanced Database Systems), held on 5-9 September 2021 in Pizzo (Calabria Region, Italy), included a joint seminar on “Reminiscence of TIDB 1981” with invited talks given by some of the participants to the Advanced Seminar on Theoretical Issues in Databases (TIDB), which took place in the same region exactly forty years earlier. The joint seminar was concluded by a Panel on “The Past and the Future of Computer Science Theory” with the participation of four distinguished computer science theorists (Ronald Fagin, Georg Gottlob, Christos Papadimitriou and Moshe Vardi), who were interviewed by Giorgio Ausiello, Maurizio Lenzerini, Luigi Palopoli, Domenico Saccà and Francesco Scarcello. This paper reports the summaries of the four interviews

How 'universal' is the United Nations' Universal Periodic Review process? An examination of the discussions held on polygamy

In 2006, United Nations Human Rights Council was tasked to establish a new human rights monitoring mechanism: Universal Periodic Review process. The primary aim of this process is to promote and protect the universality of all human rights issues and concerns via a dialogical peer review process. The aim of this investigation isto ask the following question: has this claim of promoting and protecting the universality of the human rights been met, or challenged, during state reviews in the UPR process? The issue of polygamy has been selected as the focus for this investigation to be used, primarily, as a tool to undertake an in-depth analysis of the discussions held during state reviews in the review process. In addition, this paper will employ scholarly debates between universalism and cultural relativism, as well as the sophisticated and nuanced approaches that fall in between the polarised opposites, to analyse the discussions held on human rights during state reviews. Ultimately, the findings and discussion of this investigation will provide a unique and valuable insight to the work and operation of the UPR process, so far

A survey of visualization tools for biological network analysis

The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount of data and their heterogeneity provides a challenge for the visualization of the data. There are a wide variety of graph representations available, which most often map the data on 2D graphs to visualize biological interactions. These methods are applicable to a wide range of problems, nevertheless many of them reach a limit in terms of user friendliness when thousands of nodes and connections have to be analyzed and visualized. In this study we are reviewing visualization tools that are currently available for visualization of biological networks mainly invented in the latest past years. We comment on the functionality, the limitations and the specific strengths of these tools, and how these tools could be further developed in the direction of data integration and information sharing

Interview with Sueto Hayashida

The son of a plantation blacksmith recalls growing up in Japan and later in Keawe Camp. He describes his many household responsibilities and his plantation jobs, including delivery person, store order-taker, butcher, welder, and plumber.supervisor, delivery person, salesman, butcher, plumber; Japanese; maleInterview conducted in English.State, Privat

Making Metaquerying Practical for Hi(DL-Lite R)-Knowledge Bases

Hi(DL-LiteR) is a higher-order Description Logic obtained from DL-LiteR by adding metamodeling features, and is equipped with a query language that is able to express higher-order queries. We investigate the problem of answering a particular class of such queries, called instance higher-order queries, posed over Hi(DL-LiteR) knowledge bases (KBs). The only existing algorithm for this problem is based on the idea of reducing the evaluation of a higher- order query q over a Hi(DL-LiteR) KB to the evaluation of a union of first-order queries over a DL-LiteR KB, built from q by instantiating its metavariables in all possible ways. Although of polynomial time complexity with respect to the size of the KB, this algorithm turns out to be inefficient in practice. In this paper we present a new algorithm, called Smart Binding Planner (SBP), that compiles Q into a program, that issues a sequence of first-order conjunctive queries, where each query has the goal of providing the bindings for metavariables of the next ones, and the last one completes the process by computing the answers to Q. We also illustrate some experiments showing that, in practice, SBP is significantly more efficient than the previous approach