{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:44:04Z","timestamp":1648572244055},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T00:00:00Z","timestamp":1281657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00287-010-0465-z","type":"journal-article","created":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T08:08:06Z","timestamp":1281600486000},"page":"452-461","source":"Crossref","is-referenced-by-count":0,"title":["Logik und Automaten: ein echtes Dreamteam"],"prefix":"10.1007","volume":"33","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"465_CR1","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier C, Katoen J-P (2008) Principles of Model Checking. The MIT Press, Cambridge, MA"},{"key":"465_CR2","doi-asserted-by":"crossref","unstructured":"Benedikt M, Koch C (2009) From XQuery to relational logics. ACM T Database Syst 34(4) Article 25","DOI":"10.1145\/1620585.1620592"},{"key":"465_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04558-9","volume-title":"Systems and Software Verification. Model-Checking Techniques and Tools","author":"B B\u00e9rard","year":"2001","unstructured":"B\u00e9rard B, Bidoit M, Finkel A, Laroussinie F, Petit A, Petrucci L, Schnoebelen P (2001) Systems and Software Verification. Model-Checking Techniques and Tools. Springer, Heidelberg"},{"issue":"1","key":"465_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0306-4379(01)00033-3","volume":"27","author":"G Bex","year":"2002","unstructured":"Bex G, Maneth S, Neven F (2002) A formal model for an expressive fragment of XSLT. Inform Syst 27(1):21\u201339","journal-title":"Inform Syst"},{"key":"465_CR5","doi-asserted-by":"crossref","unstructured":"Bex GJ, Neven F, Schwentick T, Vansummeren S (2010) Inference of concise regular expressions and DTDs. ACM T Database Syst 35(2) Article 11","DOI":"10.1145\/1735886.1735890"},{"key":"465_CR6","doi-asserted-by":"crossref","unstructured":"Bojanczyk M, Parys P (2008) XPath evaluation in linear time. In: International Symposium on Principles of Database Systems (PODS), pp 241\u2013250","DOI":"10.1145\/1376916.1376951"},{"key":"465_CR7","doi-asserted-by":"crossref","unstructured":"Bojanczyk M, Muscholl A, Schwentick T, Segoufin L (2009) Two-variable logic on data trees and XML reasoning. J ACM 56(3) Article 13","DOI":"10.1145\/1516512.1516515"},{"issue":"2","key":"465_CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein A, Wood D (1998) One-unambiguous regular languages. Inform Comput 142(2):182\u2013206","journal-title":"Inform Comput"},{"key":"465_CR9","unstructured":"Gelade W, Neven F (2008) Succinctness of the complement and intersection of regular expressions. In: Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp 325\u2013336"},{"issue":"1","key":"465_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G Gottlob","year":"2004","unstructured":"Gottlob G, Koch C (2004) Monadic datalog and the expressive power of languages for Web information extraction. J ACM 51(1):74\u2013113","journal-title":"J ACM"},{"key":"465_CR11","unstructured":"Gottlob G, Koch C, Baumgartner R, Herzog M, Flesca S (2004) The Lixto data extraction project \u2013 back and forth between theory and practice. In: International Symposium on Principles of Database Systems (PODS), pp 1\u201312"},{"issue":"2","key":"465_CR12","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G Gottlob","year":"2005","unstructured":"Gottlob G, Koch C, Pichler R (2005) Efficient algorithms for processing XPath queries. ACM T Database Syst 30(2):444\u2013491","journal-title":"ACM T Database Syst"},{"issue":"4","key":"465_CR13","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/1042046.1042051","volume":"29","author":"TJ Green","year":"2004","unstructured":"Green TJ, Gupta A, Miklau G, Onizuka M, Suciu D (2004) Processing XML streams with deterministic automata and stream indexes. ACM T Database Syst 29(4):752\u2013788","journal-title":"ACM T Database Syst"},{"issue":"1\u20132","key":"465_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.tcs.2007.02.062","volume":"380","author":"M Grohe","year":"2007","unstructured":"Grohe M, Koch C, Schweikardt N (2007) Tight lower bounds for query processing on streaming and external memory data. Theor Comput Sci 380(1\u20132):199\u2013217","journal-title":"Theor Comput Sci"},{"key":"465_CR15","doi-asserted-by":"crossref","unstructured":"Grumberg O, Veith H (eds) (2008) 25 Years of Model Checking \u2013 History, Achievements, Perspectives, vol 5000 of Lecture Notes in Computer Science. Springer, Heidelberg","DOI":"10.1007\/978-3-540-69850-0"},{"key":"465_CR16","unstructured":"Lixto Software. URL: http:\/\/www.lixto.com\/, letzter Zugriff 8.4.2010"},{"issue":"4","key":"465_CR17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W Martens","year":"2007","unstructured":"Martens W, Niehren J (2007) On the minimization of XML Schemas and tree automata for unranked trees. J Comput Syst Sci 73(4):550\u2013583","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"465_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1324185.1324188","volume":"36","author":"W Martens","year":"2007","unstructured":"Martens W, Neven F, Schwentick T (2007) Simple off the shelf abstractions for XML Schema. Sigmod RECORD 36(3):15\u201322","journal-title":"Sigmod RECORD"},{"issue":"2","key":"465_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1083784.1083792","volume":"34","author":"M Marx","year":"2005","unstructured":"Marx M, de Rijke M (2005) Semantic characterizations of navigational XPath. Sigmod RECORD 34(2):41\u201346","journal-title":"Sigmod RECORD"},{"key":"465_CR20","doi-asserted-by":"crossref","unstructured":"Parys P (2009) XPath evaluation in linear time with polynomial combined complexity. In: International Symposium on Principles of Database Systems (PODS), pp 55\u201364","DOI":"10.1145\/1559795.1559805"},{"issue":"2","key":"465_CR21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1815918.1815922","volume":"38","author":"N Schweikardt","year":"2009","unstructured":"Schweikardt N (2009) Machine models for query processing. Sigmod RECORD 38(2):18\u201328","journal-title":"Sigmod RECORD"},{"issue":"1","key":"465_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/974121.974140","volume":"33","author":"T Schwentick","year":"2004","unstructured":"Schwentick T (2004) XPath query containment. Sigmod RECORD 33(1):101\u2013109","journal-title":"Sigmod RECORD"},{"key":"465_CR23","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages, vol III","author":"W Thomas","year":"1997","unstructured":"Thomas W (1997) Languages, automata, and logic. In: Rozenberg G, Salomaa A (eds) Handbook of Formal Languages, vol III. Springer, New York, pp 389\u2013455"},{"key":"465_CR24","doi-asserted-by":"crossref","unstructured":"Vardi MY (2003) Logic and automata: A match made in heaven. In: International Colloquium on Automata, Languages and Programming (ICALP), pp 64\u201365","DOI":"10.1007\/3-540-45061-0_6"},{"key":"465_CR25","first-page":"150","volume-title":"25 Years of Model Checking \u2013 History, Achievements, Perspectives, vol 5000 of Lecture Notes in Computer Science","author":"MY Vardi","year":"2008","unstructured":"Vardi MY (2008) From Church and Prior to PSL. In: Grumberg O, Veith H (eds) 25 Years of Model Checking \u2013 History, Achievements, Perspectives, vol 5000 of Lecture Notes in Computer Science. Springer, Heidelberg, pp 150\u2013171"},{"key":"465_CR26","doi-asserted-by":"crossref","unstructured":"Vianu V (2009) Automatic verification of database-driven systems: a new frontier. In: International Conference Database Theory (ICDT), pp 1\u201313","DOI":"10.1145\/1514894.1514896"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0465-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-010-0465-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0465-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:08:16Z","timestamp":1559412496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-010-0465-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,13]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["465"],"URL":"https:\/\/doi.org\/10.1007\/s00287-010-0465-z","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,13]]}}}