Description logics (DLs) have a long tradition in computer science and knowledge
representation, being designed so that domain knowledge can be described and so that …

JSON--the most popular data format for sending API requests and responses--is still lacking
a standardized schema or meta-data definition that allows the developers to specify the …

In recent years, we have witnessed a revival of the use of recursive queries in a variety of
emerging application domains such as data integration and exchange, information …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

This survey gives an overview of formal results on the XML query language XPath. We
identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then …

Probabilistic databases are databases where the value of some attributes or the presence of
some records are uncertain and known only with some probability. Applications in many …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

Graph neural networks (GNNs) are deep learning architectures for machine learning
problems on graphs. It has recently been shown that the expressiveness of GNNs can be …

Graph data modeling and querying arises in many practical application domains such as
social and biological networks where the primary focus is on concepts and their …

The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …