Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable.
Viktor K. SabelfeldPublished in: Inf. Process. Lett. (1981)
Keyphrases
- datalog programs
- special case
- linear space
- tree structure
- polynomial hierarchy
- tree languages
- reduced order
- recursive queries
- data complexity
- deductive databases
- monadic second order logic
- tree structures
- approximation algorithms
- conjunctive queries
- query answering
- computational complexity
- leaf nodes
- data structure
- b tree
- index structure
- knowledge representation