The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite.
Olivier LyPublished in: FSTTCS (2000)
Keyphrases
- theorem proving
- bounded treewidth
- graph theoretic
- higher level
- deductive databases
- graph matching
- graph representation
- hierarchical structure
- graph structure
- graph model
- graph mining
- random graphs
- lower level
- directed graph
- datalog queries
- graph construction
- query processing
- equational theories
- datalog programs
- graph partitioning
- complex structures
- logic programming
- data model