{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:42Z","timestamp":1740123882143,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T00:00:00Z","timestamp":1481587200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10472-016-9532-8","type":"journal-article","created":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T06:45:52Z","timestamp":1481611552000},"page":"283-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounded variability of metric temporal logic"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1040-3201","authenticated-orcid":false,"given":"Carlo A.","family":"Furia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Spoletini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,13]]},"reference":[{"issue":"5","key":"9532_CR1","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1145\/186025.186058","volume":"16","author":"M Abadi","year":"1994","unstructured":"Abadi, M., Lamport, L.: An old-fashioned recipe for real-time. ACM Trans. Program. Lang. Syst. 16(5), 1543\u20131571 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"9532_CR2","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"9532_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/inco.1993.1025","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Inf. Comp. 104(1), 35\u201377 (1993)","journal-title":"Inf. Comp."},{"issue":"1","key":"9532_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"9532_CR5","doi-asserted-by":"crossref","unstructured":"Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. Logical Methods in Computer Science 5(1) (2009)","DOI":"10.2168\/LMCS-5(1:1)2009"},{"key":"9532_CR6","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The Cost of Punctuality. In: ACM\/IEEE Symposium on Logic in Computer Science, pp 109\u2013120 (2007)","DOI":"10.1109\/LICS.2007.49"},{"key":"9532_CR7","doi-asserted-by":"crossref","unstructured":"Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: The dark side of interval temporal logic: Sharpening the undecidability border. In: International Symposium on Temporal Representation and Reasoning, pp 131\u2013138 (2011)","DOI":"10.1109\/TIME.2011.21"},{"issue":"2","key":"9532_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10270-011-0195-y","volume":"12","author":"D Bresolin","year":"2013","unstructured":"Bresolin, D., Della monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Metric propositional neighborhood logics on natural numbers. Softw. Syst. Model. 12(2), 245\u2013264 (2013)","journal-title":"Softw. Syst. Model."},{"key":"9532_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.tcs.2014.03.033","volume":"560","author":"D Bresolin","year":"2014","unstructured":"Bresolin, D., Monica, D. D., Montanari, A., Sala, P., Sciavicco, G.: Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. Theor. Comput. Sci. 560, 269\u2013291 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"9532_CR10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2012.10.043","volume":"493","author":"D Bresolin","year":"2013","unstructured":"Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers. Theor. Comput. Sci. 493, 98\u2013115 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"9532_CR11","doi-asserted-by":"crossref","unstructured":"Chaochen, Z., Hansen, M.R., Sestoft, P.: Decidability and Undecidability Results for Duration Calculus. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 665, pp 58\u201368. Springer (1993)","DOI":"10.1007\/3-540-56503-5_8"},{"issue":"1","key":"9532_CR12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1006\/inco.2001.3094","volume":"174","author":"S Demri","year":"2002","unstructured":"Demri, S., Schnoebelen, P.: The complexity of propositional linear temporal logics in simple cases. Inf. Comput. 174(1), 84\u2013103 (2002)","journal-title":"Inf. Comput."},{"issue":"1","key":"9532_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10009-005-0214-9","volume":"9","author":"D D\u2019Souza","year":"2007","unstructured":"D\u2019Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. STTT 9(1), 1\u20134 (2007)","journal-title":"STTT"},{"issue":"1","key":"9532_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10009-005-0214-9","volume":"9","author":"D D\u2019Souza","year":"2007","unstructured":"D\u2019Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. STTT 9(1), 1\u20134 (2007)","journal-title":"STTT"},{"key":"9532_CR15","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science, vol. B, pp 996\u20131072. Elsevier Science (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"2","key":"9532_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00165-004-0032-y","volume":"16","author":"M Fr\u00e4nzle","year":"2004","unstructured":"Fr\u00e4nzle, M.: Model-checking dense-time duration calculus. Formal Asp. Comput. 16(2), 121\u2013139 (2004)","journal-title":"Formal Asp. Comput."},{"key":"9532_CR17","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling Time in Computing. Monographs in Theoretical Computer Science. An EATCS series Springer (2012)","DOI":"10.1007\/978-3-642-32332-4"},{"key":"9532_CR18","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Rossi, M.: MTL with bounded variability: Decidability and complexity. In: FORMATS, LNCS. Extended version in [19], vol. 5215, pp 109\u2013123. Springer (2008)","DOI":"10.1007\/978-3-540-85778-5_9"},{"key":"9532_CR19","unstructured":"Furia, C.A., Rossi, M.: MTL with bounded variability: Decidability and complexity. Tech. Rep. 2008.10, Dipartimento di Elettronica e Informazione, Politecnico di Milano. Available at http:\/\/bugcounting.net\/publications.html#MTLwBoundedVar-TR08 (2008)"},{"issue":"1","key":"9532_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1838552.1838560","volume":"12","author":"CA Furia","year":"2010","unstructured":"Furia, C.A., Rossi, M.: A theory of sampling for continuous-time metric temporal logic. ACM Transactions on Computational Logic 12(1), 1\u201340 (2010). Article 8","journal-title":"ACM Transactions on Computational Logic"},{"key":"9532_CR21","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Spoletini, P.: On Relaxing Metric Information in Linear Temporal Logic. In: International Symposium on Temporal Representation and Reasoning, pp 72\u201379. IEEE (2011)","DOI":"10.1109\/TIME.2011.9"},{"key":"9532_CR22","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Spoletini, P.: Automata-Based Verification of Linear Temporal Logic Models with Bounded Variability. In: International Symposium on Temporal Representation and Reasoning, pp 89\u201396. IEEE (2012)","DOI":"10.1109\/TIME.2012.13"},{"key":"9532_CR23","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Spoletini, P.: Bounded Variability of Metric Temporal Logic. In: Cesta, A., Combi, C., Laroussinie, F. (eds.) Proceedings of the 21st International Symposium on Temporal Representation and Reasoning (TIME\u201914), pp 155\u2013163. IEEE Computer Society (2014)","DOI":"10.1109\/TIME.2014.18"},{"key":"9532_CR24","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic (vol. 1): mathematical foundations and computational aspects, Oxford Logic Guides, vol. 28. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537694.003.0001"},{"key":"9532_CR25","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the Temporal Basis of Fairness. In: Conference Record of the 7Th Annual ACM Symposium on Principles of Programming Languages (POPL\u201980), pp 163\u2013173 (1980)","DOI":"10.1145\/567446.567462"},{"issue":"1","key":"9532_CR26","first-page":"1","volume":"62","author":"Y Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich, A.: Logics for real time: Decidability and complexity. Fundam. Inf. 62(1), 1\u201328 (2004)","journal-title":"Fundam. Inf."},{"key":"9532_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2011.11.003","volume":"214","author":"Y Hirshfeld","year":"2012","unstructured":"Hirshfeld, Y., Rabinovich, A.: Continuous time temporal logic with counting. Inf. Comput. 214, 1\u20139 (2012)","journal-title":"Inf. Comput."},{"issue":"1","key":"9532_CR28","first-page":"1","volume":"62","author":"Y Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundam. Inform. 62(1), 1\u201328 (2004)","journal-title":"Fundam. Inform."},{"key":"9532_CR29","doi-asserted-by":"crossref","unstructured":"Hunter, P., Ouaknine, J., Worrell, J.: Expressive Completeness for Metric Temporal Logic. In: LICS, pp 349\u2013357. IEEE (2013)","DOI":"10.1109\/LICS.2013.41"},{"key":"9532_CR30","volume-title":"Tense Logic and the Theory of Linear Order. Ph.D. Thesis","author":"JAW Kamp","year":"1968","unstructured":"Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. Ph.D. Thesis. University of California, Los Angeles (1968)"},{"issue":"4","key":"9532_CR31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"issue":"2","key":"9532_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"SE-3","author":"L Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3(2), 125\u2013143 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"9532_CR33","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ic.2006.08.006","volume":"205","author":"C Lutz","year":"2007","unstructured":"Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSPACE and below. Inf. Comput. 205(1), 99\u2013123 (2007)","journal-title":"Inf. Comput."},{"key":"9532_CR34","doi-asserted-by":"crossref","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: Real Time Temporal Logic: Past, present, future. In: Petterson, P., Yi, W. (eds.) Proceedings of the 3rd International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS\u201905), Lecture Notes in Computer Science, vol. 3829, pp 2\u201316. Springer-Verlag (2005)","DOI":"10.1007\/11603009_2"},{"key":"9532_CR35","doi-asserted-by":"crossref","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: From MITL to Timed Automata. In: Asarin, E., Bouyer, P. (eds.) Proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS\u201906), Lecture Notes in Computer Science, vol. 4202, pp 274\u2013289. Springer-Verlag (2006)","DOI":"10.1007\/11867340_20"},{"key":"9532_CR36","doi-asserted-by":"crossref","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: Checking Temporal Properties of Discrete, Timed and Continuous Behaviors. In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85Th Birthday, Lecture Notes in Computer Science, vol. 4800, pp 475\u2013505. Springer (2008)","DOI":"10.1007\/978-3-540-78127-1_26"},{"key":"9532_CR37","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A Hierarchy of Temporal Properties. In: Proceedings of the 9Th Annual ACM Symposium on Principles of Distributed Computing, pp 377\u2013410. ACM (1990)","DOI":"10.1145\/93385.93442"},{"key":"9532_CR38","unstructured":"Minsky, M.L.: Computation: Finite and infinite machines prentice hall (1967)"},{"key":"9532_CR39","doi-asserted-by":"crossref","unstructured":"Montanari, A., Pazzaglia, M., Sala, P.: Metric Propositional Neighborhood Logic with an Equivalence Relation. In: 21St International Symposium on Temporal Representation and Reasoning, (TIME), pp 49\u201358. IEEE Computer Society (2014)","DOI":"10.1109\/TIME.2014.26"},{"key":"9532_CR40","unstructured":"Montanari, A., Puppis, G., Sala, P.: Decidability of the Interval Temporal Logic A A \u0304 B B \u0304 $\\mathsf {A}\\bar {\\mathsf {A}}\\mathsf {B}\\bar {\\mathsf {B}}$ over the Rationals. In: Mathematical Foundations of Computer Science 2014 - 39Th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, pp 451\u2013463 (2014)"},{"key":"9532_CR41","doi-asserted-by":"crossref","unstructured":"Montanari, A., Sala, P.: An Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals. In: 19Th International Symposium on Temporal Representation and Reasoning, TIME 2012, Leicester, United Kingdom, September 12-14, 2012, pp 39\u201346 (2012)","DOI":"10.1109\/TIME.2012.18"},{"key":"9532_CR42","doi-asserted-by":"crossref","unstructured":"Nickovic, D., Piterman, N.: From MTL to Deterministic Timed Automata. In: Chatterjee, K., Henzinger, T.A. (eds.) Formal Modeling and Analysis of Timed Systems \u2013 8th International Conference, FORMATS 2010, Lecture Notes in Computer Science, vol. 6246, pp 152\u2013167. Springer (2010)","DOI":"10.1007\/978-3-642-15297-9_13"},{"key":"9532_CR43","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Rabinovich, A., Worrell, J.: Time-Bounded Verification. In: Bravetti, M. , Zavattaro, G. (eds.) CONCUR 2009 \u2013 Concurrency Theory, 20th International Conference, Lecture Notes in Computer Science, vol. 5710, pp 496\u2013510. Springer (2009)","DOI":"10.1007\/978-3-642-04081-8_33"},{"key":"9532_CR44","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On Metric Temporal Logic and Faulty Turing Machines. In: FoSSaCS, LNCS, vol. 3921, pp 217\u2013230. Springer (2006)","DOI":"10.1007\/11690634_15"},{"key":"9532_CR45","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1) (2007)","DOI":"10.2168\/LMCS-3(1:8)2007"},{"key":"9532_CR46","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Some Recent Results in Metric Temporal Logic. In: FORMATS, LNCS, vol. 5215, pp 1\u201313. Springer (2008)","DOI":"10.1007\/978-3-540-85778-5_1"},{"key":"9532_CR47","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Towards a Theory of Time-Bounded Verification. In: Abramsky, S., Gavoille, C., Kirchner, C., auf der Heide, F.M., Spirakis, P.G. (eds.) Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Lecture Notes in Computer Science, vol. 6199, pp 22\u201337. Springer (2010)","DOI":"10.1007\/978-3-642-14162-1_3"},{"key":"9532_CR48","unstructured":"Papadimitriou, C.: Computational complexity Addison-Wesley (1994)"},{"key":"9532_CR49","unstructured":"Perrin, D., Pin, J.E.\u0301: Infinite Words, Pure and Applied Mathematics, vol. 141. Elsevier (2004)"},{"key":"9532_CR50","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Proceedings of the 18Th Annual Symposium on Foundations of Computer Science, SFCS \u201977, pp 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9532_CR51","doi-asserted-by":"crossref","unstructured":"Rabinovich, A.: Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. In: FORMATS, Lecture Notes in Computer Science, vol. 5215, pp 93\u2013108. Springer (2008)","DOI":"10.1007\/978-3-540-85778-5_8"},{"issue":"22-24","key":"9532_CR52","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.tcs.2010.03.017","volume":"411","author":"A Rabinovich","year":"2010","unstructured":"Rabinovich, A.: Complexity of metric temporal logics with counting and the Pnueli modalities. Theor. Comput. Sci. 411(22-24), 2331\u20132342 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"9532_CR53","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1006\/inco.1999.2816","volume":"156","author":"AM Rabinovich","year":"2000","unstructured":"Rabinovich, A.M.: Expressive completeness of Duration Calculus. Inf. Comput. 156(1-2), 320\u2013344 (2000)","journal-title":"Inf. Comput."},{"issue":"8","key":"9532_CR54","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1016\/j.apal.2010.01.002","volume":"161","author":"M Reynolds","year":"2010","unstructured":"Reynolds, M.: The complexity of temporal logic over the reals. Ann. Pure Appl. Logic 161(8), 1063\u20131096 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"9532_CR55","doi-asserted-by":"crossref","first-page":"437","DOI":"10.3166\/jancl.20.437-455","volume":"20","author":"M Reynolds","year":"2010","unstructured":"Reynolds, M.: Metric temporal reasoning with less than two clocks. Journal of Applied Non-Classical Logics 20(4), 437\u2013455 (2010)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"9532_CR56","doi-asserted-by":"crossref","unstructured":"Reynolds, M.: A New Metric Temporal Logic for Hybrid Systems. In: 20Th International Symposium on Temporal Representation and Reasoning (TIME), pp 73\u201380. IEEE Computer Society (2013)","DOI":"10.1109\/TIME.2013.17"},{"key":"9532_CR57","unstructured":"Rogers, Jr., H.: Theory of recursive functions and effective computability MIT press (1987)"},{"key":"9532_CR58","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C., Sturgis, H.E.: Computability of recursive functions. J. ACM 10(2) (1963)","DOI":"10.1145\/321160.321170"},{"issue":"3","key":"9532_CR59","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"AP Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733\u2013749 (1985)","journal-title":"J. ACM"},{"key":"9532_CR60","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Logics for Concurrency \u2013 Structure versus Automata (8Th Banff Higher Order Workshop), Lecture Notes in Computer Science, vol. 1043, pp 238\u2013266. Springer (1995)","DOI":"10.1007\/3-540-60915-6_6"},{"key":"9532_CR61","unstructured":"Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: LICS, pp 332\u2013344. IEEE (1986)"},{"key":"9532_CR62","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In: FTRTFT, LNCS, vol. 863, pp 694\u2013715. Springer (1994)","DOI":"10.1007\/3-540-58468-4_191"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-016-9532-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9532-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9532-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T04:32:43Z","timestamp":1718944363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-016-9532-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,13]]},"references-count":62,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9532"],"URL":"https:\/\/doi.org\/10.1007\/s10472-016-9532-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2016,12,13]]}}}