{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:48:08Z","timestamp":1725655688521},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242052"},{"type":"electronic","value":"9783642242069"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24206-9_6","type":"book-chapter","created":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T03:23:02Z","timestamp":1327634582000},"page":"88-105","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Bounded Treewidth with Datalog (A Survey)"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Pichler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"6_CR2","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"6_CR4","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph Rewriting: An Algebraic and Logic Approach. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 193\u2013242. Elsevier Science Publishers, Amsterdam (1990)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput.\u00a085, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. J. Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM\u00a049, 716\u2013752 (2002)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci.\u00a04, 406\u2013451 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M. Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic\u00a0130, 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR11","unstructured":"Maryns, H.: On the Implementation of Tree Automata: Limitations of the Naive Approach. In: Proc. TLT 2006: 5th Int. Treebanks and Linguistic Theories Conference, pp. 235\u2013246 (2006)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-48168-0_3","volume-title":"Computer Science Logic","author":"M. Grohe","year":"1999","unstructured":"Grohe, M.: Descriptive and Parameterized Complexity. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 14\u201331. Springer, Heidelberg (1999)"},{"key":"6_CR13","first-page":"165","volume-title":"Proc. PODS 2007","author":"G. Gottlob","year":"2007","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Monadic datalog over finite structures with bounded treewidth. In: Proc. PODS 2007, pp. 165\u2013174. ACM, New York (2007); Full version to appear in ACM Trans. Comput. Log."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G. Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell.\u00a0174, 105\u2013132 (2010)","journal-title":"Artif. Intell."},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-89439-1_31","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Jakl","year":"2008","unstructured":"Jakl, M., Pichler, R., R\u00fcmmele, S., Woltran, S.: Fast counting with bounded treewidth. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 436\u2013450. Springer, Heidelberg (2008)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-17511-4_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Pichler","year":"2010","unstructured":"Pichler, R., R\u00fcmmele, S., Woltran, S.: Counting and enumeration problems with bounded treewidth. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 387\u2013404. Springer, Heidelberg (2010) (to appear)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/S1571-0653(05)80078-2","volume":"8","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics\u00a08, 54\u201357 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.disc.2005.12.017","volume":"306","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Safe separators for treewidth. Discrete Mathematics\u00a0306, 337\u2013350 (2006)","journal-title":"Discrete Mathematics"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J.\u00a051, 255\u2013269 (2008)","journal-title":"Comput. J."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-006-1226-x","volume":"47","author":"F. Eijkhof van den","year":"2007","unstructured":"van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica\u00a047, 139\u2013158 (2007)","journal-title":"Algorithmica"},{"key":"6_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth: Computations and Approximations. Springer, Berlin (1994)"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics\u00a0108, 23\u201352 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR24","volume-title":"Foundations of databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)"},{"key":"6_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S. Ceri","year":"1990","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)"},{"key":"6_CR26","first-page":"137","volume-title":"Proc. STOC 1982","author":"M.Y. Vardi","year":"1982","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proc. STOC 1982, pp. 137\u2013146. ACM, New York (1982)"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for Web information extraction. J. ACM\u00a051, 74\u2013113 (2004)","journal-title":"J. ACM"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program.\u00a01, 267\u2013284 (1984)","journal-title":"J. Log. Program."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","volume":"29","author":"M. Minoux","year":"1988","unstructured":"Minoux, M.: LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett.\u00a029, 1\u201312 (1988)","journal-title":"Inf. Process. Lett."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/504077.504079","volume":"3","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Gr\u00e4del, E., Veith, H.: Datalog lite: a deductive query language with linear time model checking. ACM Trans. Comput. Log.\u00a03, 42\u201379 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR31","series-title":"Springer Monographs in Mathematics","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory, 2nd edn. Springer Monographs in Mathematics. Springer, Heidelberg (1999)","edition":"2"},{"key":"6_CR32","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"6_CR33","unstructured":"Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: Proc. ISLP, pp. 387\u2013401 (1991)"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log.\u00a07, 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms\u00a08, 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"6_CR36","unstructured":"Courcelle, B., Durand, I.A.: Verifying monadic second order graph properties with tree automata. In: European LISP Symposium, pp. 7\u201321 (2010)"}],"container-title":["Lecture Notes in Computer Science","Datalog Reloaded"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24206-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T13:40:37Z","timestamp":1556199637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24206-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242052","9783642242069"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24206-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}