Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Easy problems for tree-decomposable graphs
Journal of Algorithms
Negation in rule-based database languages: a survey
Selected papers of the workshop on Deductive database theory
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Languages, automata, and logic
Handbook of formal languages, vol. 3
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of translating logic to finite automata
Automata logics, and infinite games
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Automata- and logic-based pattern languages for tree-structured data
Proceedings of the 2nd international conference on Semantics in databases
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Hi-index | 0.00 |
We model the monadic second-order logic (MSO) evaluation problem on finite colored trees in a purely database theoretic framework, based on the well-knownMSO-automata connection: we reduce the problem to an acyclic conjunctive query evaluation problem on the one hand and to a monadic datalog evaluation problem on the other hand. This approach offers the possibility to solve the MSO problem using optimized evaluation methods for relational algebra expressions and for datalog programs (such as Yannakakis algorithm [27] and the rewriting method using resolutionbased filtering referred to as "magic sets" method in [3]): we use these methods for evaluating our queries and giving estimates of their complexity. This is the first time, to our knowledge, that a solution to the MSO evaluation problem related to relational algebra is given; furthermore, thanks to this reduction, we prove that the automata-based algorithm given in [8] constitutes a particular "instance" of Yannakakis algorithm. Besides the optimized database methods that we propose for solving the MSO evaluation problem, our results prove that MSO-definable queries over colored trees are datalog-definable; this result subsumes the corresponding result in [12] which states that unary MSO queries are monadic datalog-definable and it also subsumes the well-known result that any MSO-definable class of trees is monadic datalog-definable.