{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T11:40:07Z","timestamp":1749987607326,"version":"3.41.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_2","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T10:39:21Z","timestamp":1487155161000},"page":"27-47","source":"Crossref","is-referenced-by-count":0,"title":["Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"2_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Arenas, M., Gottlob, G., Pieris, A.: Expressive languages for querying the semantic web. In: PODS, pp. 14\u201326 (2014)","DOI":"10.1145\/2594538.2594555"},{"key":"2_CR3","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","author":"F Baader","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45402-0_2","volume-title":"Logic Programming and Nonmotonic Reasoning","author":"R Baumgartner","year":"2001","unstructured":"Baumgartner, R., Flesca, S., Gottlob, G.: Declarative information extraction, web crawling, and recursive wrapping with Lixto. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 21\u201341. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45402-0_2"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-45653-8_38","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R Baumgartner","year":"2001","unstructured":"Baumgartner, R., Flesca, S., Gottlob, G.: The elog web extraction language. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 548\u2013560. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45653-8_38"},{"key":"2_CR6","unstructured":"Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with lixto. In: VLDB, pp. 119\u2013128 (2001)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-10843-2_7","volume-title":"Automata, Languages and Programming","author":"C Beeri","year":"1981","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73\u201385. Springer, Heidelberg (1981). doi: 10.1007\/3-540-10843-2_7"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.3873","volume":"48","author":"A Cal\u00ec","year":"2013","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115\u2013174 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","volume":"14","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57\u201383 (2012)","journal-title":"J. Web Sem."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Cali, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+\/-: a family of logical knowledge representation and query languages for new applications. In: LICS, pp. 228\u2013242 (2010)","DOI":"10.1109\/LICS.2010.27"},{"issue":"4","key":"2_CR11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.is.2011.09.006","volume":"37","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Ontological query answering under expressive entity-relationship schemata. Inf. Syst. 37(4), 320\u2013335 (2012)","journal-title":"Inf. Syst."},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.artint.2012.08.002","volume":"193","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: the query answering problem. Artif. Intell. 193, 87\u2013128 (2012)","journal-title":"Artif. Intell."},{"key":"2_CR13","unstructured":"Cal\u00ec, A., Kifer, M.: Containment of conjunctive object meta-queries. In: VLDB, pp. 942\u2013952 (2006)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs (preliminary report). In: STOC, pp. 477\u2013490 (1988)","DOI":"10.1145\/62212.62259"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, chap. 5, pp. 193\u2013242. Elsevier Science Publishers B.V. (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"3","key":"2_CR16","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-36285-1_15","volume-title":"Database Theory \u2014 ICDT 2003","author":"A Deutsch","year":"2003","unstructured":"Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225\u2013241. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36285-1_15"},{"issue":"5","key":"2_CR18","doi-asserted-by":"crossref","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. 4(5), 406\u2013451 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"2_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-44503-X_2","volume-title":"Database Theory \u2014 ICDT 2001","author":"J Flum","year":"2001","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. In: Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 22\u201338. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44503-X_2"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: LICS, pp. 22\u201325 (2003)","DOI":"10.1109\/LICS.2003.1210058"},{"issue":"14","key":"2_CR22","first-page":"1845","volume":"7","author":"T Furche","year":"2014","unstructured":"Furche, T., Gottlob, G., Grasso, G., Guo, X., Orsi, G., Schallhart, C., Wang, C.: DIADEM: thousands of websites to a single database. PVLDB 7(14), 1845\u20131856 (2014)","journal-title":"PVLDB"},{"key":"2_CR23","unstructured":"Furche, T., Gottlob, G., Libkin, L., Orsi, G., Paton, N.W.: Data wrangling for big data: challenges and opportunities. In: EDBT, pp. 473\u2013478 (2016)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11837787_1","volume-title":"Reasoning Web","author":"T Furche","year":"2006","unstructured":"Furche, T., Linse, B., Bry, F., Plexousakis, D., Gottlob, G.: RDF querying: language constructs and evaluation methods compared. In: Barahona, P., Bry, F., Franconi, E., Henze, N., Sattler, U. (eds.) Reasoning Web 2006. LNCS, vol. 4126, pp. 1\u201352. Springer, Heidelberg (2006). doi: 10.1007\/11837787_1"},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.artint.2014.04.004","volume":"213","author":"G Gottlob","year":"2014","unstructured":"Gottlob, G., Kikot, S., Kontchakov, R., Podolskii, V.V., Schwentick, T., Zakharyaschev, M.: The price of query rewriting in ontology-based data access. Artif. Intell. 213, 42\u201359 (2014)","journal-title":"Artif. Intell."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: LICS, pp. 189\u2013202 (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"issue":"1","key":"2_CR27","doi-asserted-by":"crossref","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 51(1), 74\u2013113 (2004)","journal-title":"J. ACM"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11611257_3","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"G Gottlob","year":"2006","unstructured":"Gottlob, G., Koch, C.: A formal comparison of visual web wrapper generators. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 30\u201348. Springer, Heidelberg (2006). doi: 10.1007\/11611257_3"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Baumgartner, R., Herzog, M., Flesca, S.: The Lixto data extraction project: back and forth between theory and practice. In: PODS, pp. 1\u201312 (2004)","DOI":"10.1145\/1055558.1055560"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB, pp. 95\u2013106 (2002)","DOI":"10.1016\/B978-155860869-6\/50017-2"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: PODS, pp. 179\u2013190 (2003)","DOI":"10.1145\/773153.773171"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. In: PODS, pp. 189\u2013200 (2004)","DOI":"10.1145\/1055558.1055585"},{"key":"2_CR33","unstructured":"Gottlob, G., Manna, M., Pieris, A.: Polynomial rewritings for linear existential rules. In: IJCAI, pp. 2992\u20132998 (2015)"},{"issue":"3","key":"2_CR34","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/2638546","volume":"39","author":"G Gottlob","year":"2014","unstructured":"Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. ACM Trans. Database Syst. 39(3), 25:1\u201325:46 (2014)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Orsi, G., Pieris, A.: Consistency checking of re-engineered UML class diagrams via Datalog+\/-. In: RuleML, pp. 35\u201353 (2015)","DOI":"10.1007\/978-3-319-21542-6_3"},{"key":"2_CR36","unstructured":"Gottlob, G., Pieris, A.: Beyond SPARQL under OWL 2 QL entailment regime: rules to the rescue. In: IJCAI, pp. 2999\u20133007 (2015)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Rudolph, S., Simkus, M.: Expressiveness of guarded existential rule languages. In: PODS, pp. 27\u201338 (2014)","DOI":"10.1145\/2594538.2594556"},{"key":"2_CR38","unstructured":"Gottlob, G., Schwentick, T.: Rewriting ontological queries into small nonrecursive datalog programs. In: KR (2012)"},{"key":"2_CR39","unstructured":"Grau, B.C., Horrocks, I., Kr\u00f6tzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity conditions and their application to query answering in description logics. In: KR (2012)"},{"key":"2_CR40","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)"},{"issue":"1","key":"2_CR41","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0022-0000(84)90081-3","volume":"28","author":"DS Johnson","year":"1984","unstructured":"Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167\u2013189 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR42","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/210332.210335","volume":"42","author":"M Kifer","year":"1995","unstructured":"Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. ACM 42, 741\u2013843 (1995)","journal-title":"J. ACM"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Koch, C.: Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach. In: VLDB, pp. 249\u2013260 (2003)","DOI":"10.1016\/B978-012722442-8\/50030-6"},{"issue":"2","key":"2_CR44","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0169-023X(01)00047-7","volume":"40","author":"AHF Laender","year":"2002","unstructured":"Laender, A.H.F., Ribeiro-Neto, B.A., da Silva, A.S.: Debye - data extraction by example. Data Knowl. Eng. 40(2), 121\u2013154 (2002)","journal-title":"Data Knowl. Eng."},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Liu, L., Pu, C., Han, W.: XWRAP: An XML-enabled wrapper construction system for web information sources. In: ICDE, pp. 611\u2013621 (2000)","DOI":"10.1109\/ICDE.2000.839475"},{"issue":"8","key":"2_CR46","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0306-4379(98)00030-1","volume":"23","author":"B Lud\u00e4scher","year":"1998","unstructured":"Lud\u00e4scher, B., Himmer\u00f6der, R., Lausen, G., May, W., Schlepphorst, C.: Managing semistructured data with FLORID: a deductive object-oriented perspective. Inf. Syst. 23(8), 589\u2013613 (1998)","journal-title":"Inf. Syst."},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Lukasiewicz, T., Martinez, M.V., Pieris, A., Simari, G.I.: From classical to consistent query answering under existential rules. In: AAAI, pp. 1546\u20131552 (2015)","DOI":"10.1609\/aaai.v29i1.9414"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13\u201322 (2009)","DOI":"10.1145\/1559795.1559799"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-44503-X_22","volume-title":"Database Theory \u2014 ICDT 2001","author":"H Meuss","year":"2001","unstructured":"Meuss, H., Schulz, K.U., Bry, F.: Towards aggregated answers for semistructured data. In: Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 346\u2013360. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44503-X_22"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-21542-6_18","volume-title":"Rule Technologies: Foundations, Tools, and Applications","author":"M Milani","year":"2015","unstructured":"Milani, M., Bertossi, L.: Ontology-based multidimensional contexts with applications to quality data specification and extraction. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 277\u2013293. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21542-6_18"},{"issue":"1","key":"2_CR51","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/373626.373713","volume":"30","author":"RJ Miller","year":"2001","unstructured":"Miller, R.J., Hern\u00e1ndez, M.A., Haas, L.M., Yan, L., Ho, C.T.H., Fagin, R., Popa, L.: The clio project: managing heterogeneity. SIGMOD Rec. 30(1), 78\u201383 (2001)","journal-title":"SIGMOD Rec."},{"issue":"1","key":"2_CR52","doi-asserted-by":"crossref","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. 29(1), 1\u201312 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR53","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/505241.505245","volume":"49","author":"F Neven","year":"2002","unstructured":"Neven, F., den Bussche, J.V.: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1), 56\u2013100 (2002)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"2_CR54","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. Theor. Comput. Sci. 275(1\u20132), 633\u2013674 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-60608-4_40","volume-title":"Deductive and Object-Oriented Databases","author":"Y Papakonstantinou","year":"1995","unstructured":"Papakonstantinou, Y., Gupta, A., Garcia-Molina, H., Ullman, J.: A query translation scheme for rapid implementation of wrappers. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds.) DOOD 1995. LNCS, vol. 1013, pp. 161\u2013186. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60608-4_40"},{"issue":"3","key":"2_CR56","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0169-023X(00)00051-3","volume":"36","author":"A Sahuguet","year":"2001","unstructured":"Sahuguet, A., Azavant, F.: Building intelligent web applications using lightweight wrappers. Data Knowl. Eng. 36(3), 283\u2013316 (2001)","journal-title":"Data Knowl. Eng."},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: PODS, pp. 155\u2013166 (2003)","DOI":"10.1145\/773153.773169"},{"issue":"1","key":"2_CR58","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW 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. Math. Syst. Theory 2(1), 57\u201381 (1968)","journal-title":"Math. Syst. Theory"},{"key":"2_CR59","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389\u2013455. Springer, Heidelberg (1997). Chapter 7"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T11:16:47Z","timestamp":1749986207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}