{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:20Z","timestamp":1740099020828,"version":"3.37.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319761671"},{"type":"electronic","value":"9783319761688"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76168-8_3","type":"book-chapter","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T03:43:27Z","timestamp":1518752607000},"page":"41-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extended Floyd-Hoare Logic over Relational Nominative Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4078-1062","authenticated-orcid":false,"given":"Mykola","family":"Nikitchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ievgen","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4565-9082","authenticated-orcid":false,"given":"Artur","family":"Korni\u0142owicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrii","family":"Kryvolap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R Floyd","year":"1967","unstructured":"Floyd, R.: Assigning meanings to programs. Math. Asp. Comput. Sci. 19, 19\u201332 (1967)","journal-title":"Math. Asp. Comput. Sci."},{"issue":"10","key":"3_CR2","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C Hoare","year":"1969","unstructured":"Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"issue":"4","key":"3_CR3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K Apt","year":"1981","unstructured":"Apt, K.: Ten years of Hoare\u2019s logic: a survey - part I. ACM Trans. Program. Lang. Syst. 3(4), 431\u2013483 (1981). http:\/\/doi.acm.org\/10.1145\/357146.357150","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"3_CR4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1093\/jigpal\/jzi032","volume":"13","author":"R H\u00e4hnle","year":"2005","unstructured":"H\u00e4hnle, R.: Many-valued logic, partiality, and abstraction in formal specification languages. Log. J. IGPL 13(4), 415\u2013433 (2005). http:\/\/dx.doi.org\/10.1093\/jigpal\/jzi032","journal-title":"Log. J. IGPL"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Jones, C.: Reasoning about partial functions in the formal development of programs. In: AVoCS 2005. Electronic Notes in Theoretical Computer Science, vol. 145, pp. 3\u201325. Elsevier (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.10.002","DOI":"10.1016\/j.entcs.2005.10.002"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0015254","volume-title":"Computer Science Today","author":"D Gries","year":"1995","unstructured":"Gries, D., Schneider, F.B.: Avoiding the undefined by underspecification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 366\u2013373. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015254"},{"key":"3_CR7","first-page":"45","volume":"5","author":"M Duzi","year":"2003","unstructured":"Duzi, M.: Do we have to deal with partiality? Misc. Log. 5, 45\u201376 (2003)","journal-title":"Misc. Log."},{"key":"3_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-319-03998-5_18","volume-title":"Information and Communication Technologies in Education, Research, and Industrial Applications","author":"A Kryvolap","year":"2013","unstructured":"Kryvolap, A., Nikitchenko, M., Schreiner, W.: Extending Floyd-Hoare logic for partial pre- and postconditions. In: Ermolayev, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds.) ICTERI 2013. CCIS, vol. 412, pp. 355\u2013378. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03998-5_18"},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.15546\/aeei-2013-0052","volume":"13","author":"M Nikitchenko","year":"2013","unstructured":"Nikitchenko, M., Kryvolap, A.: Properties of inference systems for Floyd-Hoare logic with partial predicates. Acta Electrotech. Inform. 13(4), 70\u201378 (2013)","journal-title":"Acta Electrotech. Inform."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-13206-8_6","volume-title":"Communications in Computer and Information Science, ICTERI","author":"V Skobelev","year":"2014","unstructured":"Skobelev, V., Nikitchenko, M., Ivanov, I.: On algebraic properties of nominative data and functions. In: Ermolayev, V., Mayr, H., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds.) Communications in Computer and Information Science, ICTERI, vol. 469, pp. 117\u2013138. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13206-8_6"},{"key":"3_CR11","unstructured":"Nikitchenko, M., Shkilniak, S.: Mathematical logic and theory of algorithms. Publishing house of Taras Shevchenko National University of Kyiv, Ukraine (2008). (in Ukrainian)"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1007\/s10559-009-9159-4","volume":"45","author":"M Nikitchenko","year":"2009","unstructured":"Nikitchenko, M.: Composition-nominative aspects of address programming. Cybern. Syst. Anal. 45, 864 (2009). https:\/\/doi.org\/10.1007\/s10559-009-9159-4","journal-title":"Cybern. Syst. Anal."},{"key":"3_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11542384","volume-title":"The Seventeen Provers of the World. Foreword by Dana S. Scott","year":"2006","unstructured":"Wiedijk, F. (ed.): The Seventeen Provers of the World. Foreword by Dana S. Scott. LNAI, vol. 3600. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11542384"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-1-4612-3658-0_10","volume-title":"Current Trends in Hardware Verification and Automated Theorem Proving","author":"M Gordon","year":"1989","unstructured":"Gordon, M.: Mechanizing programming logics in higher order logic. In: Birtwistle, G., Subrahmanyam, P. (eds.) Current Trends in Hardware Verification and Automated Theorem Proving, pp. 387\u2013439. Springer, New York (1989). https:\/\/doi.org\/10.1007\/978-1-4612-3658-0_10"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01383984","volume":"3","author":"J Wright Von","year":"1993","unstructured":"Von Wright, J., Hekanaho, J., Luostarinen, P., Langbacka, T.: Mechanizing some advanced refinement concepts. Form. Methods Syst. Des. 3(1), 49\u201381 (1993). https:\/\/doi.org\/10.1007\/BF01383984","journal-title":"Form. Methods Syst. Des."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-20615-8_17","volume-title":"Intelligent Computer Mathematics","author":"G Bancerek","year":"2015","unstructured":"Bancerek, G., Byli\u0144ski, C., Grabowski, A., Korni\u0142owicz, A., Matuszewski, R., Naumowicz, A., Pa\u0327k, K., Urban, J.: Mizar: state-of-the-art and beyond. In: Kerber, M., Carette, J., Kaliszyk, C., Rabe, F., Sorge, V. (eds.) CICM 2015. LNCS (LNAI), vol. 9150, pp. 261\u2013279. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20615-8_17"},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10817-015-9345-1","volume":"55","author":"A Grabowski","year":"2015","unstructured":"Grabowski, A., Korni\u0142owicz, A., Naumowicz, A.: Four decades of Mizar. J. Autom. Reason. 55(3), 191\u2013198 (2015). http:\/\/dx.doi.org\/10.1007\/s10817-015-9345-1","journal-title":"J. Autom. Reason."},{"issue":"1","key":"3_CR18","first-page":"9","volume":"1","author":"A Trybulec","year":"1990","unstructured":"Trybulec, A.: Tarski Grothendieck set theory. Formaliz. Math. 1(1), 9\u201311 (1990)","journal-title":"Formaliz. Math."},{"issue":"1","key":"3_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207160701864459","volume":"87","author":"A Naumowicz","year":"2010","unstructured":"Naumowicz, A.: Interfacing external CA systems for Gr\u00f6bner bases computation in Mizar proof checking. Int. J. Comput. Math. 87(1), 1\u201311 (2010). http:\/\/dx.doi.org\/10.1080\/00207160701864459","journal-title":"Int. J. Comput. Math."},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-08434-3_37","volume-title":"Intelligent Computer Mathematics","author":"A Naumowicz","year":"2014","unstructured":"Naumowicz, A.: SAT-enhanced Mizar proof checking. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 449\u2013452. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3_37"},{"issue":"3","key":"3_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10817-015-9332-6","volume":"55","author":"A Naumowicz","year":"2015","unstructured":"Naumowicz, A.: Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver. J. Autom. Reason. 55(3), 285\u2013294 (2015). http:\/\/dx.doi.org\/10.1007\/s10817-015-9332-6","journal-title":"J. Autom. Reason."},{"issue":"2","key":"3_CR22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10817-012-9261-6","volume":"50","author":"A Korni\u0142owicz","year":"2013","unstructured":"Korni\u0142owicz, A.: On rewriting rules in Mizar. J. Autom. Reason. 50(2), 203\u2013210 (2013). http:\/\/dx.doi.org\/10.1007\/s10817-012-9261-6","journal-title":"J. Autom. Reason."},{"key":"3_CR23","first-page":"238","volume":"44","author":"A Korni\u0142owicz","year":"2015","unstructured":"Korni\u0142owicz, A.: Flexary connectives in Mizar. Comput. Lang. Syst. Struct. 44, 238\u2013250 (2015). http:\/\/dx.doi.org\/10.1016\/j.cl.2015.07.002","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"3","key":"3_CR24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10817-015-9331-7","volume":"55","author":"A Korni\u0142owicz","year":"2015","unstructured":"Korni\u0142owicz, A.: Definitional expansions in Mizar. J. Autom. Reason. 55(3), 257\u2013268 (2015). http:\/\/dx.doi.org\/10.1007\/s10817-015-9331-7","journal-title":"J. Autom. Reason."},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27, 356\u2013364 (1980). http:\/\/doi.acm.org\/10.1145\/322186.322198","journal-title":"J. ACM"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Grabowski, A., Korni\u0142owicz, A., Schwarzweller, C.: Equality in computer proof-assistants. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Proceedings of the 2015 FedCSIS. Annals of Computer Science and Information Systems, vol. 5, pp. 45\u201354. IEEE (2015). https:\/\/doi.org\/10.15439\/2015F229","DOI":"10.15439\/2015F229"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-27818-4_21","volume-title":"Mathematical Knowledge Management","author":"A Naumowicz","year":"2004","unstructured":"Naumowicz, A., Byli\u0144ski, C.: Improving Mizar texts with properties and requirements. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 290\u2013301. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27818-4_21"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-42547-4_12","volume-title":"Intelligent Computer Mathematics","author":"A Korni\u0142owicz","year":"2016","unstructured":"Korni\u0142owicz, A.: Enhancement of Mizar texts with transitivity property of predicates. In: Kohlhase, M., Johansson, M., Miller, B., de de Moura, L., Tompa, F. (eds.) CICM 2016. LNCS (LNAI), vol. 9791, pp. 157\u2013162. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42547-4_12"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Naumowicz, A., Korni\u0142owicz, A.: Introducing Euclidean relations to Mizar. [47], pp. 245\u2013248. https:\/\/doi.org\/10.15439\/2017F368","DOI":"10.15439\/2017F368"},{"issue":"3","key":"3_CR30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10817-015-9333-5","volume":"55","author":"A Grabowski","year":"2015","unstructured":"Grabowski, A.: Mechanizing complemented lattices within Mizar type system. J. Autom. Reason. 55(3), 211\u2013221 (2015). http:\/\/dx.doi.org\/10.1007\/s10817-015-9333-5","journal-title":"J. Autom. Reason."},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Grabowski, A., Korni\u0142owicz, A., Schwarzweller, C.: On algebraic hierarchies in mathematical repository of Mizar. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Proceedings of the 2016 FedCSIS. Annals of Computer Science and Information Systems, vol. 8, pp. 363\u2013371. IEEE (2016). https:\/\/doi.org\/10.15439\/2016F520","DOI":"10.15439\/2016F520"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-73451-2_17","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"A Grabowski","year":"2007","unstructured":"Grabowski, A., Jastrz\u0119bska, M.: Rough set theory from a math-assistant perspective. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 152\u2013161. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73451-2_17"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-14128-7_26","volume-title":"Intelligent Computer Mathematics","author":"A Grabowski","year":"2010","unstructured":"Grabowski, A., Schwarzweller, C.: On duplication in mathematical repositories. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) CICM 2010. LNCS (LNAI), vol. 6167, pp. 300\u2013314. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14128-7_26"},{"issue":"3","key":"3_CR34","first-page":"1","volume":"10","author":"K P\u0105k","year":"2014","unstructured":"P\u0105k, K.: Improving legibility of natural deduction proofs is not trivial. Log. Methods Comput. Sci. 10(3), 1\u201330 (2014). http:\/\/dx.doi.org\/10.2168\/LMCS-10(3:23)2014","journal-title":"Log. Methods Comput. Sci."},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"P\u0105k, K.: Automated improving of proof legibility in the Mizar system. [48], pp. 373\u2013387. https:\/\/doi.org\/10.1007\/978-3-319-08434-3_27","DOI":"10.1007\/978-3-319-08434-3_27"},{"issue":"3","key":"3_CR36","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10817-015-9337-1","volume":"55","author":"K P\u0105k","year":"2015","unstructured":"P\u0105k, K.: Improving legibility of formal proofs based on the close reference principle is NP-hard. J. Autom. Reason. 55(3), 295\u2013306 (2015). http:\/\/dx.doi.org\/10.1007\/s10817-015-9337-1","journal-title":"J. Autom. Reason."},{"key":"3_CR37","volume-title":"Semantics with Applications - A Formal Introduction","author":"H Nielson","year":"1992","unstructured":"Nielson, H., Nielson, F.: Semantics with Applications - A Formal Introduction. Wiley, Hoboken (1992)"},{"issue":"3","key":"3_CR38","first-page":"194","volume":"2","author":"M Nikitchenko","year":"2012","unstructured":"Nikitchenko, M., Tymofieiev, V.: Satisfiability in composition-nominative logics. Cent. Eur. J. Comput. Sci. 2(3), 194\u2013213 (2012). https:\/\/doi.org\/10.2478\/s13537-012-0027-3","journal-title":"Cent. Eur. J. Comput. Sci."},{"key":"3_CR39","volume-title":"A Discipline of Programming","author":"E Dijkstra","year":"1997","unstructured":"Dijkstra, E.: A Discipline of Programming, 1st edn. Prentice Hall PTR, Upper Saddle River (1997)","edition":"1"},{"issue":"2(68)","key":"3_CR40","first-page":"102","volume":"23","author":"M Nikitchenko","year":"2015","unstructured":"Nikitchenko, M., Shkilniak, S.: Semantic properties of T-consequence relation in logics of quasiary predicates. Comput. Sci. J. Mold. 23(2(68)), 102\u2013122 (2015)","journal-title":"Comput. Sci. J. Mold."},{"key":"3_CR41","unstructured":"Ivanov, I., Korni\u0142owicz, A., Nikitchenko, M.: Formalization of nominative data in Mizar. In: Proceedings of TAAPSD 2015, pp. 82\u201385. Taras Shevchenko National University of Kyiv, Ukraine, 23\u201326 December 2015"},{"issue":"3","key":"3_CR42","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1515\/forma-2017-0020","volume":"25","author":"I Ivanov","year":"2017","unstructured":"Ivanov, I., Nikitchenko, M., Kryvolap, A., Korni\u0142owicz, A.: Simple-named complex-valued nominative data - definition and basic operations. Formaliz. Math. 25(3), 205\u2013216 (2017). http:\/\/dx.doi.org\/10.1515\/forma-2017-0020","journal-title":"Formaliz. Math."},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Korni\u0142owicz, A., Kryvolap, A., Nikitchenko, M., Ivanov, I.: Formalization of the algebra of nominative data in Mizar. [47], pp. 237\u2013244. https:\/\/doi.org\/10.15439\/2017F301","DOI":"10.15439\/2017F301"},{"key":"3_CR44","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-67229-8_16","volume-title":"Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology \u2013 ISAT 2017","author":"A Korni\u0142owicz","year":"2018","unstructured":"Korni\u0142owicz, A., Kryvolap, A., Nikitchenko, M., Ivanov, I.: Formalization of the nominative algorithmic algebra in Mizar. In: \u015awi\u0105tek, J., Borzemski, L., Wilimowska, Z. (eds.) ISAT 2017. AISC, vol. 656, pp. 176\u2013186. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-67229-8_16"},{"key":"3_CR45","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17th LICS, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"3_CR47","unstructured":"Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.): Proceedings of FedCSIS 2017. Annals of Computer Science and Information Systems, vol. 11. IEEE, Prague, Czech Republic, 3\u20136 September 2017"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08434-3","volume-title":"Intelligent Computer Mathematics","year":"2014","unstructured":"Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.): CICM 2014. LNCS (LNAI), vol. 8543. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3"}],"container-title":["Communications in Computer and Information Science","Information and Communication Technologies in Education, Research, and Industrial Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76168-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T22:41:40Z","timestamp":1570747300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76168-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319761671","9783319761688"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76168-8_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}