d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries...