Monadic datalog over finite structures of bounded treewidth

ACM Transactions on Computational Logic

Volumn 12, Issue 1, 2010, Pages

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

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

Indexed keywords

DATALOG; FIXED-PARAMETER TRACTABILITY; MONADIC SECOND-ORDER LOGIC; TREE DECOMPOSITION; TREE-WIDTH;

GRAPH THEORY; THEOREM PROVING;

QUERY LANGUAGES;

EID: 78649341098     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1838552.1838555     Document Type: Article

References (58)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
2. ANDRÉKA, H., VAN BENTHEM, J., AND NEMETI, I. 1995. Back and forth between modal logic and classical logic. Logic J. IGPL 3, 5, 685-720.
3. ARNBORG, S., LAGERGREN, J., AND SEESE, D. 1991. Easy problems for tree-decomposable graphs. J. Algorithms. 12, 2, 308-340.
4. BEERI, C. AND BERNSTEIN, P. A. 1979. Computational problems related to the design of normal form relational schemas. ACM Trans. Datab. Syst. 4, 1, 30-59.
5. BODLAENDER, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305-1317.
6. BODLAENDER, H.L. AND KOSTER, A. M. C. A. 2006. Safe separators for treewidth. Discrete Math. 306, 3, 337-350.
7. BODLAENDER, H.L. AND KOSTER, A. M. C. A. 2008. Combinatorial optimization on graphs of bounded treewidth. Comput.J. 51, 3, 255-269.
8. ±: A unified approach to ontologies and integrity constraints. In Proceedings of ICDT. ACM International Conference Proceeding Series, vol. 361. ACM Press, New York, NY, 14-30.
9. CALÌ, A., GOTTLOB, G., AND LUKASIEWICZ, T. 2009b. A general datalog-based framework for tractable query answering over ontologies. In Proceedings of PODS. ACM Press, New York, NY, 77-86.
10. CERI, S., GOTTLOB, G., AND TANCA, L. 1990. Logic Programming and Databases. Springer, Berlin, Germany.
11. COURCELLE, B. 1987. An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theor. Comput. Sci. 55, 2-3, 141-181.
12. COURCELLE, B. 1990a. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B. Elsevier Science Publishers, Amsterdam, The Netherlands, 193-242.
13. COURCELLE, B. 1990b. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. Comput. 85, 1, 12-75.
14. DONER, J. 1970. Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 5, 406-451.
15. DOWLING, W.F. AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1, 3, 267-284.
16. DOWNEY, R.G. AND FELLOWS, M. R. 1999. Parameterized Complexity. Springer, New York, NY.
17. EBBINGHAUS, H.-D. AND FLUM, J. 1999. Finite Model Theory, 2nd ed. Springer Monographsin Mathematics. Springer, Berlin, Germany.
18. EITER, T. AND GOTTLOB, G. 1995. The complexity of logic-based abduction. J. ACM 42, 1, 3-42.
19. EITER, T., GOTTLOB, G., AND VEITH, H. 1997a. Generalized quantifiers in logic programs. In Proceedings of the ESSLLI Workshop. Lecture Notes in Computer Science, vol. 1754. Springer, Berlin, Germany, 72-98.
20. EITER, T., GOTTLOB, G., AND VEITH, H. 1997b. Modular logic programming and generalized quantifiers. In Proceedings of LPNMR. Lecture Notes in Computer Science, vol. 1265. Springer, Berlin, Germany, 290-309.
21. EITER, T., IANNI, G., SCHINDLAUER, R., AND TOMPITS, H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In Proceedings of IJCAI. 90-96. www.jcai.org.
22. EITER, T., IANNI, G., SCHINDLAUER, R., AND TOMPITS, H. 2006. Effective integration of declarative rules with external evaluations for semantic-Web reasoning. In Proceedings of ESWC .Lecture Notes in Computer Science, vol. 4011. Springer, 273-287.
23. FILÉ, G. 1985. Tree automata and logic programs. In Proceedings of STACS. Lecture Notes in Computer Science, vol. 182. Springer, Berlin, Germany, 119-130.
24. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 6, 716-752.
25. FLUM, J. AND GROHE, M. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Berlin, Germany.
26. FOUSTOUCOS, E. AND GUESSARIAN, I. 2006. Complexity of monadic inf-datalog. application to temporal logic. CoRR abs/cs/0603122. http://arxiv.org/abs/cs/0603122.
27. FRICK, M. AND GROHE, M. 2004. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130, 1-3, 3-31.
28. GOTTLOB, G. 1997. Relativized logspace and generalized quantifiers over finite ordered structures. J. Symb. Log. 62, 2, 545-574.
29. GOTTLOB, G., GRÄDEL, E., AND VEITH, H. 2002. Datalog LITE: A deductive query language with linear time model checking. ACM Trans. Comput. Logic 3, 1, 42-79.
30. GOTTLOB, G. AND KOCH, C. 2004. Monadic datalog and the expressive power of languages for Web information extraction. J. ACM 51, 1, 74-113.
31. GOTTLOB, G., PICHLER, R., AND WEI, F. 2006a. Bounded treewidth as a key to tractability of knowledge representation and reasoning. In Proceedings of AAAI. AAAI Press, Menlo Park, CA, 250-256.
32. GOTTLOB, G., PICHLER, R., AND WEI, F. 2006b. Tractable database design through bounded treewidth. In Proceedings of PODS. ACM Press, New York, NY, 124-133.
33. GOTTLOB, G., PICHLER, R., AND WEI, F. 2007. Monadic datalog over finite structures with bounded treewidth. In Proceedings of PODS. ACM Press, New York, NY, 165-174.
34. GOTTLOB, G., PICHLER, R., AND WEI, F. 2008. Abduction with bounded treewidth: From theoretical tractability to practically efficient computation. In Proceedings of AAAI. AAAI Press, Menlo Park, CA, 1541-1546.
35. GROHE, M. 1999. Descriptive and parameterized complexity. In Proceedings of CSL.Lecture Notes in Computer Science, vol. 1683. Springer, Berlin, Germany, 14-31.
36. GUSTEDT, J., MæHLE, O. A., AND TELLE, J. A. 2002. The treewidth of Java programs. In Proceedings of(ALENEX). 4th International Workshop on Algorithm Engineering and Experiments, Revised Papers. Lecture Notes in Computer Science, vol. 2409. Springer, Berlin, Germany, 86-97.
37. HERRE, H., KRYNICKI, M., PINUS, A., AND VÄÄNANEN, J. A. 1991. The Härtig quantifier: A survey. J. Symb. Log. 56, 4, 1153-1183.
38. JAKL, M., PICHLER, R., AND WOLTRAN, S. 2009. Answer-set programming with bounded treewidth. In Proceedings of IJCAI. 816-822.
39. KLARLUND, N., MøLLER, A., AND SCHWARTZBACH, M. I. 2002. MONA implementation secrets. Int. J. Found. Comput. Sci. 13, 4, 571-586.
40. Earlier version in Proceedings of CIAA, Lecture Notes in Computer Science, vol. 2088, Berlin, Germany.
41. KLOKS, T. 1994. Treewidth: Computations and Approximations. Springer, Berlin, Germany.
42. KOSTER, A.M.C.A., BODLAENDER, H.L., AND VAN HOESEL, S. P. M. 2001. Treewidth: Computational experiments. Electron. Notes Discrete Math. 8, 54-57.
43. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S., AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7, 3, 499-562.
44. LIBKIN, L. 2004. Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Berlin, Germany.
45. MAKOWSKY, J. A. 2004. Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic 126, 1-3, 159-213.
46. MANNILA, H. AND RÄIHÄ;, K.-J. 1992. The design of relational databases. Addison-Wesley, Reading, ma.
47. MARQUE-PUCHEU, G. 1983. Rational set of trees and the algebraic semantics of logic programming. Acta Inform. 20, 249-260.
48. MARYNS, H. 2006. On the implementation of tree automata: Limitations of the naive approach. In Proceedings of the TLT. 5th International Treebanks and Linguistic Theories Conference (TLT). 235-246.
49. MINOUX, M. 1988. LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. Inform. Process. Lett. 29, 1, 1-12.
50. NEVEN, F. AND SCHWENTICK, T. 2002. Query automata over finite trees. Theor. Comput. Sci. 275, 1-2, 633-674.
51. PALÙ, A.D., DOVIER, A., PONTELLI, E., AND ROSSI, G. 2009. Answer set programming with constraints using lazy grounding. In Proceedings of ICLP. 115-129.
52. SHER, G. 1997. Partially-ordered (branching) generalized quantifiers: A general definition. J. Phil. Log. 26, 1-43.
53. THATCHER, J.W. AND WRIGHT, J. B. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theor. 2, 1, 57-81.
54. THOMAS, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, Vol. III. Springer, New York, NY, 389-455.
55. THORUP, M. 1998. All structured programs have small tree-width and good register allocation. Inform. Comput. 142, 2, 159-181.
56. ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems, Vol.1.Computer Science Press, New York, NY.
57. VAN DEN EIJKHOF, F., BODLAENDER, H.L., AND KOSTER, A. M. C. A. 2007. Safe reduction rules for weighted treewidth. Algorithmica 47, 2, 139-158.
58. VARDI, M. Y. 1982. The complexity of relational query languages (extended abstract). In Proceedings of STOC. ACM Press, New York, NY, 137-146.