Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.
Robert GanianJan ObdrzálekPublished in: CoRR (2013)
Keyphrases
- expressive power
- monadic second order logic
- bounded tree width
- data complexity
- tree width
- query language
- first order logic
- closure properties
- computational properties
- structured data
- relational algebra
- transitive closure
- database
- regular expressions
- directed acyclic graph
- query evaluation
- tree automata
- conjunctive queries
- relational calculus
- aggregate functions
- user defined aggregates