{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:11Z","timestamp":1630432091636},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P20704-N18"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2010,10]]},"abstract":"Bounded treewidth and monadic second-order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know that any property of finite structures, which is expressible by an MSO sentence, can be decided in linear time (data complexity) if the structures have bounded treewidth. In principle, Courcelle's Theorem can be applied directly to construct concrete algorithms by transforming the MSO evaluation problem into a tree language recognition problem. The latter can then be solved via a finite tree automaton (FTA). However, this approach has turned out to be problematical, since even relatively simple MSO formulae may lead to a \u201cstate explosion\u201d of the FTA.<\/jats:p>\n \n In this work we propose monadic datalog (i.e., datalog where all intentional predicate symbols are unary) as an alternative method to tackle this class of fixed-parameter tractable problems. We show that if some property of finite structures is expressible in MSO then this property can also be expressed by means of a monadic datalog program over the\n decomposed structure<\/jats:italic>\n : we mean by this that the original structure is augmented with new elements and new relations that encode one of its tree decompositions. In the first place, we thus compare the expressive power of two query languages. However, we also show that the resulting fragment of datalog can be evaluated in linear time (both with respect to the program size and with respect to the data size). Hence, our transformation of an MSO query into a monadic datalog program yields an alternative proof of Courcelle's Theorem. In order to actually construct efficient algorithms for problems whose tractability is due to Courcelle's Theorem, we propose to use a fragment of full (i.e., not necessarily monadic) datalog which allows for a succinct representation of the corresponding monadic datalog programs and for an efficient execution. This new approach is put to work by devising datalog programs for the 3-Colorability problem of graphs and for the PRIMALITY problem of relational schemas (i.e., testing if some attribute in a relational schema is part of a key). We also report on experimental results with a prototype implementation.\n <\/jats:p>","DOI":"10.1145\/1838552.1838555","type":"journal-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T14:16:37Z","timestamp":1288793797000},"page":"1-48","source":"Crossref","is-referenced-by-count":13,"title":["Monadic datalog over finite structures of bounded treewidth"],"prefix":"10.1145","volume":"12","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[{"name":"Oxford University, Oxford, U.K."}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}]},{"given":"Fang","family":"Wei","sequence":"additional","affiliation":[{"name":"Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","unstructured":"Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley Reading MA. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley Reading MA."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/3.5.685"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320064.320066"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.017"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm037"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514897"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ceri S. Gottlob G. and Tanca L. 1990. Logic Programming and Databases. Springer Berlin Germany. Ceri S. Gottlob G. and Tanca L. 1990. Logic Programming and Databases. Springer Berlin Germany.","DOI":"10.1007\/978-3-642-83952-8"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90102-2"},{"key":"e_1_2_1_12_1","volume-title":"Handbook of Theoretical Computer Science","author":"Courcelle B."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80041-1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90014-1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer New York NY. Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer New York NY.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_2_1_17_1","unstructured":"Ebbinghaus H.-D. and Flum J. 1999. Finite Model Theory 2nd ed. Springer Monographs in Mathematics. Springer Berlin Germany. Ebbinghaus H.-D. and Flum J. 1999. Finite Model Theory 2nd ed. Springer Monographs in Mathematics. Springer Berlin Germany."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200838"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the ESSLLI Workshop. Lecture Notes in Computer Science","volume":"1754","author":"Eiter T."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of LPNMR. Lecture Notes in Computer Science","volume":"1265","author":"Eiter T."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of IJCAI. 90--96","author":"Eiter T."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11762256_22"},{"key":"e_1_2_1_23_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of STACS","author":"Fil\u00e9 G."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_2_1_25_1","unstructured":"Flum J. and Grohe M. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer Berlin Germany. Flum J. and Grohe M. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer Berlin Germany."},{"key":"e_1_2_1_26_1","unstructured":"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. 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."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.01.007"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275546"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/504077.504079"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962450"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of AAAI. AAAI Press","author":"Gottlob G."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142370"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265554"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of AAAI. AAAI Press","author":"Gottlob G."},{"key":"e_1_2_1_35_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CSL","author":"Grohe M."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of (ALENEX). 4th International Workshop on Algorithm Engineering and Experiments, Revised Papers. Lecture Notes in Computer Science","volume":"2409","author":"Gustedt J."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275466"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of IJCAI. 816--822","author":"Jakl M."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/647267.760182"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(05)80078-2"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Libkin L. 2004. Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer Berlin Germany. Libkin L. 2004. Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer Berlin Germany.","DOI":"10.1007\/978-3-662-07003-1"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2003.11.002"},{"key":"e_1_2_1_45_1","unstructured":"Mannila H. and R\u00e4ih\u00e4 K.-J. 1992. The design of relational databases. Addison-Wesley Reading MA. Mannila H. and R\u00e4ih\u00e4 K.-J. 1992. The design of relational databases. Addison-Wesley Reading MA."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01257085"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the TLT. 5th International Treebanks and Linguistic Theories Conference (TLT). 235--246","author":"Maryns H.","year":"2006"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90124-X"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00301-2"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_14"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017944808396"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"},{"key":"e_1_2_1_53_1","volume-title":"Handbook of Formal Languages","author":"Thomas W."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2697"},{"key":"e_1_2_1_55_1","unstructured":"Ullman J. D. 1989. Principles of Database and Knowledge-Base Systems Vol. 1. Computer Science Press New York NY. Ullman J. D. 1989. Principles of Database and Knowledge-Base Systems Vol. 1. Computer Science Press New York NY."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1226-x"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1838552.1838555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T17:09:33Z","timestamp":1613927373000},"score":1,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1145\/1838552.1838555"],"URL":"http:\/\/dx.doi.org\/10.1145\/1838552.1838555","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":["Computational Mathematics","Logic","General Computer Science","Theoretical Computer Science"],"published":{"date-parts":[[2010,10]]}}}