Definability equals recognizability for graphs of bounded treewidth.

Mikolaj Bojanczyk Michal Pilipczuk

Published in: LICS (2016)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
boolean functions
highly parallelizable
propositional logic
relational learning
monadic datalog
database
graph theoretic
fixed parameter tractable
special case
query language
integrity constraints
inductive logic programming