Regularity Equals Monadic Second-Order Definability for Quasi-trees.
Bruno CourcellePublished in: Fields of Logic and Computation II (2015)
Keyphrases
- decision trees
- fixed point
- propositional logic
- monadic second order logic
- deductive databases
- tree construction
- constraint qualification
- datalog programs
- higher order
- high order
- databases
- expressive power
- tree models
- labeled trees
- tree structure
- data integration
- fourth order
- tree automata
- hessian matrix
- datalog queries
- special case