A query algorithm based on homomorphism counts is a procedure for determ...
This paper describes several cases of adjunction in the homomorphism ord...
A Datalog program can be viewed as a syntactic specification of a functo...
We study the use of local consistency methods as reductions between
cons...
The fitting problem for conjunctive queries (CQs) is the problem to cons...
We study the power of the bounded-width consistency algorithm in the con...
Given a pair of graphs A and B, the problems of
deciding whether there e...
We answer the question which conjunctive queries are uniquely characteri...
We study the complexity of the Distributed Constraint Satisfaction Probl...
Ontology-mediated querying and querying in the presence of constraints a...
In this paper we study alternative characterizations of dismantlability
...
Many existing global constraints can be encoded as a conjunction of amon...
A natural and established way to restrict the constraint satisfaction pr...