Monadic second order finite satisfiability and unbounded tree-width.

Tomer Kotek Helmut Veith Florian Zuleger

Published in: CoRR (2015)

Keyphrases

tree width
structural properties
tree decomposition
constraint networks
np complete
conjunctive queries
datalog programs
higher order
shortest path
computational complexity
relational structures
deductive databases
computationally challenging
lower bound
query answering