Monadic datalog over finite structures with bounded treewidth

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 165-174

  Gottlob, Georg ^a   Pichler, Reinhard ^b   Wei, Fang ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Datalog; Fixed parameter tractability; Monadic second order logic; Tree decomposition; Treewidth

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

FINITE TREE AUTOMATON (FTA); FIXED PARAMETER TRACTABILITY; MONADIC SECOND ORDER LOGIC; TREE DECOMPOSITION; TREE LANGUAGE RECOGNITION PROBLEMS;

DATA STRUCTURES;

EID: 35448951776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265554     Document Type: Conference Paper

References (27)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison-Wesley, 1995.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy Problems for Tree-Decomposable Graphs. J. Algorithms, 12(2):308-340, 1991.
3. H. L. Bodlaender. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
4. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer, 1990.
5. B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B, pages 193-242. Elsevier Science Publishers, 1990.
6. J. Doner. Tree acceptors and some of their applications. J. Comput. Syst. Sci., 4(5):406-451, 1970.
7. W. F. Dowling and J. H. Gallier. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program., 1(3):267-284, 1984.
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, New York, 1999.
9. H.-D. Ebbinghaus and J. Flum. Finite Model Theory, 2nd edition. Springer Monographs in Mathematics. Springer, 1999.
10. T. Eiter and G. Gottlob. The Complexity of Logic-Based Abduction. J. ACM, 42(1):3-42, 1995.
11. T. Eiter, G. Gottlob, and H. Veith. Generalized quantifiers in logic programs. In ESSLLI'97 Workshop, volume 1754 of LNCS, pages 72-98. Springer, 1997.
12. T. Eiter, G. Gottlob, and H. Veith. Modular logic programming and generalized quantifiers. In Proc. LPNMR'97, volume 1265 of LNCS, pages 290-309, 1997.
13. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6):716-752, 2002.
14. J. Flum and M. Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, 2006.
15. G. Gottlob and C. Koch. Monadic datalog and the expressive power of languages for Web information extraction. J. ACM, 51(1):74-113, 2004.
16. G. Gottlob, R. Pichler, and F. Wei. Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In Proc. AAAI 2006, pages 250-256. AAAI Press, 2006.
17. G. Gottlob, R. Pichler, and F. Wei. Tractable database design through bounded treewidth. In Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2006), pages 124-133. ACM, 2006.
18. M. Grohe. Descriptive and Parameterized Complexity. In Proc. CSL'99, volume 1683 of LNCS, pages 14-31. Springer, 1999.
19. N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA Implementation Secrets. International Journal of Foundations of Computer Science, 13(4):571-586, 2002. World Scientific Publishing Company. Earlier version in Proc. CIAA'00, LNCS vol. 2088.
20. L. Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, 2004.
21. H. Mannila and K.-J. Räihä. The design of relational databases. Addison-Wesley, 1992.
22. H. Maryns. On the Implementation of Tree Automata: Limitations of the Naive Approach. In Proc. 5th Int. Treebanks and Linguistic Theories Conference (TLT 2006), pages 235-246, 2006.
23. M. Minoux. LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett., 29(1):1-12, 1988.
24. F. Neven and T. Schwentick. Query automata over finite trees. Theoretical Computer Science, 275(1-2):633-674, 2002.
25. J. W. Thatcher and J. B. Wright. Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory, 2(1):57-81, 1968.
26. J. D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. 1. Computer Science Press, 1989.
27. M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proc. STOC'82, pages 137-146. ACM, 1982.