Network Satisfaction Problems Solved by k-Consistency

Manuel Bodirsky, Simon Knäuer

We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some nat…