Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
We study hierarchical classification in the general case when an instance could belong to more than one class node in the underlying taxonomy. Experiments done in previous work sh...
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...