{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T19:55:20Z","timestamp":1793476520451,"version":"4.5.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:00:00Z","timestamp":1556064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10472-019-09632-y","type":"journal-article","created":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T05:04:49Z","timestamp":1556082289000},"page":"193-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":87,"title":["Digital forensics and investigations meet artificial intelligence"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5686-6124","authenticated-orcid":false,"given":"Stefania","family":"Costantini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"De Gasperis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raffaele","family":"Olivieri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"9632_CR1","doi-asserted-by":"crossref","unstructured":"Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The Sciff abductive proof-procedure. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005: Advances in Artificial Intelligence, 9th Congress of the Italian Association for Artificial Intelligence, Proceedings, volume 3673 of Lecture Notes in Computer Science, pp. 135\u2013147. Springer (2005)","DOI":"10.1007\/11558590_14"},{"key":"9632_CR2","doi-asserted-by":"crossref","unstructured":"Alferes, J.J.: Preserving strong equivalence while forgetting. In: Logics in Artificial Intelligence - 14Th European Conference, JELIA 2014, Proceedings, Volume 8761 of Lecture Notes in Computer Science, pp. 412\u2013425. Springer (2014)","DOI":"10.1007\/978-3-319-11558-0_29"},{"key":"9632_CR3","unstructured":"ASP. Answer set programming solvers online (incomplete list), 2016. \n                    http:\/\/assat.cs.ust.hk\n                    \n                  , \n                    http:\/\/www.cs.utexas.edu\/users\/tag\/ccalc\/\n                    \n                  , \n                    http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels\/\n                    \n                  , \n                    http:\/\/www.cs.uky.edu\/ai\/\n                    \n                  , \n                    http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\n                    \n                  , \n                    http:\/\/www.potassco.org\n                    \n                  , \n                    http:\/\/www.tcs.hut.fi\/Software\/smodels"},{"key":"9632_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"9632_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01257083","volume":"20","author":"M Ben-Ari","year":"1983","unstructured":"Ben-Ari, M., Manna, Z., Pnueli, A.: The temporal logic of branching time. Acta Informatica 20, 207\u2013226 (1983)","journal-title":"Acta Informatica"},{"key":"9632_CR6","doi-asserted-by":"crossref","unstructured":"Borchert, P., Anger, C., Schaub, T., Truszczynski, M.: Towards systematic benchmarking in answer set programming the dagstuhl initiative. In: LPNMR, volume 2923 of Lecture Notes in Computer Science, pp. 3\u20137. Springer (2004)","DOI":"10.1007\/978-3-540-24609-1_3"},{"key":"9632_CR7","doi-asserted-by":"crossref","unstructured":"Brewka, G., Eiter, T., Fink, M.: Nonmonotonic multi-context systems: A flexible approach for integrating heterogeneous knowledge sources. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, volume 6565 of Lecture Notes in Computer Science, pp. 233\u2013258. Springer (2011)","DOI":"10.1007\/978-3-642-20832-4_16"},{"key":"9632_CR8","unstructured":"Brewka, G., Eiter, T., Fink, M., Weinzierl, A.: Managed multi-context systems. In: Walsh, T. (ed.) IJCAI 2011, Proc. of the 22nd Intl. Joint Conf. on Artificial Intelligence, pp. 786\u2013791. IJCAI\/AAAI (2011)"},{"issue":"12","key":"9632_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance . Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"9632_CR10","unstructured":"Brewka, G., Ellmauthaler, S., P\u00fchrer, J.: Multi-context systems for reactive reasoning in dynamic environments. In: Schaub, T. (ed.) ECAI 2014, Proc. of the 21st European Conf. on Artificial Intelligence. IJCAI\/AAAI (2014)"},{"key":"9632_CR11","doi-asserted-by":"crossref","unstructured":"Cabalar, P.: Causal logic programming. In: Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, Volume 7265 of Lecture Notes in Computer Science, pp. 102\u2013116. Springer (2012)","DOI":"10.1007\/978-3-642-30743-0_8"},{"key":"9632_CR12","unstructured":"Cabalar, P., Di\u00e9guez, M.: Strong equivalence of non-monotonic temporal theories. In: KR. Citeseer (2014)"},{"key":"9632_CR13","volume-title":"Handbook of Digital Forensics and Investigation","author":"E Casey","year":"2009","unstructured":"Casey, E.: Handbook of Digital Forensics and Investigation. Elsevier, Amsterdam (2009)"},{"key":"9632_CR14","volume-title":"Digital Evidence and Computer Crime: Forensic Science, Computers, and the Internet","author":"E Casey","year":"2011","unstructured":"Casey, E.: Digital Evidence and Computer Crime: Forensic Science, Computers, and the Internet. Academic press, Cambridge (2011)"},{"issue":"2","key":"9632_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(94)00259-L","volume":"149","author":"S Costantini","year":"1995","unstructured":"Costantini, S.: Contributions to the stable model semantics of logic programs with negation. Theor. Comput. Sci. 149(2), 231\u2013255 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"9632_CR16","first-page":"169","volume":"6","author":"S Costantini","year":"2006","unstructured":"Costantini, S.: On the existence of stable models of non-stratified logic programs. TPLP 6(1-2), 169\u2013212 (2006)","journal-title":"TPLP"},{"key":"9632_CR17","doi-asserted-by":"crossref","unstructured":"Costantini, S.: Ace: a flexible environment for complex event processing in logical agents. In: Baresi, L., Baldoni, M., Dastani, M. (eds.) Engineering Multi-Agent Systems, Third International Workshop, EMAS 2015, Revised Selected Papers, volume 9318 of Lecture Notes in Computer Science, Springer (2015)","DOI":"10.1007\/978-3-319-26184-3_5"},{"key":"9632_CR18","doi-asserted-by":"crossref","unstructured":"Costantini, S.: Knowledge acquisition via non-monotonic reasoning in distributed heterogeneous environments. In: Truszczy\u0144ski, M., Ianni, G., Calimeri, F. (eds.) 13th Int. Conf. on Logic Programming and Nonmonotonic Reasoning LPNMR 2013. Proc., volume 9345 of Lecture Notes in Computer Science Springer (2015)","DOI":"10.1007\/978-3-319-23264-5_20"},{"issue":"5","key":"9632_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00290-9","volume":"84","author":"S Costantini","year":"2002","unstructured":"Costantini, S., D\u2019Antona, O.M., Provetti, A.: On the equivalence and range of applicability of graph-based representations of logic programs. Inf. Process. Lett. 84 (5), 241\u2013249 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9632_CR20","unstructured":"Costantini, S., DeGasperis, G.: Exchanging data and ontological definitions in multi-agent-contexts systems. In: Paschke, A., Fodor, P., Giurca, A., Kliegr, T. (eds.) RuleMLChallenge track, Proceedings, CEUR Workshop Proceedings. CEUR-WS.org (2015)"},{"issue":"3","key":"9632_CR21","doi-asserted-by":"publisher","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":"9632_CR22","unstructured":"Delgrande, J.P., Wang, K.: Proceedings of the twenty-ninth AAAI conference on artificial intelligence, january 25-30, 2015, austin, texas, USA. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1482\u20131488. AAAI Press (2015)"},{"key":"9632_CR23","unstructured":"Deswal, S., Singhrova, A.: Application of graph theory in communication networks. International Journal of Application or Innovation in Engineering and Management 1 (2012)"},{"key":"9632_CR24","unstructured":"Dovier, A., Formisano, A.: Programmazione Dichiarativa in Prolog, CLP, ASP, e CCP. free, 2008. Available (in Italian) at \n                    http:\/\/users.dimi.uniud.it\/agostino.dovier\/DID\/corsi.html"},{"issue":"14","key":"9632_CR25","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.artint.2008.05.002","volume":"172","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Wang, K.: Semantic forgetting in answer set programming. Artif Intell. 172(14), 1644\u20131672 (2008)","journal-title":"Artif Intell."},{"key":"9632_CR26","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and Modal Logic. InL: Handbook of theoretical computer science, vol. B. MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"3","key":"9632_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016)","journal-title":"AI Mag."},{"key":"9632_CR28","doi-asserted-by":"crossref","unstructured":"Gelfond, M.: Answer sets. In: Handbook of Knowledge Representation. Chapter 7, pp 285\u2013316. Elsevier, Amsterdam (2007)","DOI":"10.1016\/S1574-6526(07)03007-6"},{"key":"9632_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach","author":"M Gelfond","year":"2014","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press, New York (2014)"},{"key":"9632_CR30","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proc. of the 5th Intl. Conf. and Symposium on Logic Programming, pp. 1070\u20131080. MIT Press (1988)"},{"key":"9632_CR31","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. N. Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"N. Gener. Comput."},{"key":"9632_CR32","unstructured":"Governatori, G.: Un modello formale per il ragionamento giuridico. PhD thesis, Dottorato Di Ricerca in Informatica Giuridica E Diritto Dell\u2019informatica - CIRFID Universit\u00e0 Di Bologna, 1996. Supervisors: Professors Alberto Artosi and Maurizio Matteuzzi"},{"issue":"6","key":"9632_CR33","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10992-013-9295-1","volume":"42","author":"G Governatori","year":"2013","unstructured":"Governatori, G., Olivieri, F., Rotolo, A., Scannapieco, S.: Computing strong and weak permissions in defeasible logic. J. Philos. Log. 42(6), 799\u2013829 (2013)","journal-title":"J. Philos. Log."},{"issue":"6","key":"9632_CR34","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"AC Kakas","year":"1992","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. J. Log. Comput. 2(6), 719\u2013770 (1992)","journal-title":"J. Log. Comput."},{"issue":"4","key":"9632_CR35","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/logcom\/9.4.515","volume":"9","author":"AC Kakas","year":"1999","unstructured":"Kakas, A.C., Toni, F.: Computing argumentation in logic programming. J. Log Comput. 9(4), 515\u2013562 (1999)","journal-title":"J. Log Comput."},{"key":"9632_CR36","unstructured":"Kautz, H.A., Selman, B., et al.: Planning as satisfiability. In: ECAI, vol. 92, pp. 359\u2013363. Citeseer (1992)"},{"key":"9632_CR37","unstructured":"Kjellerstrand, H.: Hidato. Available at \n                    http:\/\/www.hakank.org\/answer_set_programming\n                    \n                   (2015)"},{"issue":"3-4","key":"9632_CR38","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00118494","volume":"4","author":"RA Kowalski","year":"1996","unstructured":"Kowalski, R.A., Toni, F.: Abstract argumentation. Artif. Intell. Law 4(3-4), 275\u2013296 (1996)","journal-title":"Artif. Intell. Law"},{"issue":"4","key":"9632_CR39","doi-asserted-by":"publisher","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"},{"key":"9632_CR40","unstructured":"Leone, N.: Logic programming and nonmonotonic reasoning: From theory to systems and applications. In: Baral, C., Brewka, G., Schlipf, J. (eds.) Logic Programming and Nonmonotonic Reasoning, 9th Intl. Conference, LPNMR 2007. Springer (2007)"},{"key":"9632_CR41","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2, 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"9632_CR42","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Action languages, answer sets, and planning. In: The Logic Programming Paradigm, pp. 357\u2013373. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_16"},{"key":"9632_CR43","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Twelve definitions of a stable model. In: de la Banda, M.G., Pontelli, E. (eds.) Proc. of the 24th Intl. Conference on Logic Programming, volume 5366 of LNCS, pp. 37\u201351. Springer (2008)","DOI":"10.1007\/978-3-540-89982-2_8"},{"issue":"2","key":"9632_CR44","first-page":"103","volume":"7","author":"PLM Lucatuorto","year":"2006","unstructured":"Lucatuorto, P.L.M.: Intelligenza artificiale e diritto: le applicazioni giuridiche dei sistemi esperti. Ciberspazio e Diritto 7(2), 103\u2013125 (2006)","journal-title":"Ciberspazio e Diritto"},{"issue":"6","key":"9632_CR45","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1093\/logcom\/ext068","volume":"25","author":"M Maratea","year":"2015","unstructured":"Maratea, M., Pulina, L., Ricca, F.: Multi-engine ASP solving with policy adaptation. J. Log. Comput. 25(6), 1285\u20131306 (2015)","journal-title":"J. Log. Comput."},{"key":"9632_CR46","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, pp. 375\u2013398. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"9632_CR47","unstructured":"Montali, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P.: Evaluating compliance: from LTL to abductive logic programming. In: Ancona, D., Maratea, M., Mascardi, V. (eds.) Proceedings of the 30th Italian Conference on Computational Logic, volume 1459 of CEUR Workshop Proceedings, pp. 101\u2013116. CEUR-WS.org (2015)"},{"issue":"3-4","key":"9632_CR48","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell., Springer 25(3-4), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell., Springer"},{"key":"9632_CR49","unstructured":"Olivieri, R.: Digital Forensics meets Complexity Theory and Artificial Intelligence: Towards Automated Generation of Investigation Hypothesis. PhD thesis, Dottorato di ricerca in Ingegneria e Scienze dell\u2019Informazione, Universit\u00e0 degli Studi dell\u2019Aquila. Supervisor: Prof. Stefania Costantini. (2016)"},{"key":"9632_CR50","doi-asserted-by":"crossref","unstructured":"Pearce, D.: A new logical characterization of stable models and answer sets. In: Non-Monotonic Extensions of Logic Programming, Number 1216 in LNAI, pp. 55\u201370. Springer (1997)","DOI":"10.1007\/BFb0023801"},{"key":"9632_CR51","unstructured":"Pearce, D., Valverde, A.: Synonymous theories in answer set programming and equilibrium logic. In: Proc. of ECAI04, 16th Europ. Conf. on Art. Intell. pp 388\u2013390 (2004)"},{"key":"9632_CR52","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. Of FOCS, 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"issue":"4","key":"9632_CR53","first-page":"3","volume":"23","author":"E Rahm","year":"2000","unstructured":"Rahm, E., Do, H.H.: Data cleaning: Problems and current approaches. IEEE Data Eng. Bull. 23(4), 3\u201313 (2000)","journal-title":"IEEE Data Eng. Bull."},{"key":"9632_CR54","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ijar.2016.10.002","volume":"80","author":"F Riguzzi","year":"2017","unstructured":"Riguzzi, F., Bellodi, E., Zese, R., Cota, G., Lamma, E.: A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics. Int. J. Approx. Reason. 80, 313\u2013333 (2017)","journal-title":"Int. J. Approx. Reason."},{"key":"9632_CR55","unstructured":"Rotolo, A., Governatori, G., Sartor, G.: Deontic defeasible reasoning in legal interpretation: two options for modelling interpretive arguments. In: Proceedings of the 15th International Conference on Artificial Intelligence and Law, ICAIL 2015, June 8-12, 2015, pp. 99\u2013108. San Diego (2015)"},{"key":"9632_CR56","unstructured":"Smith, C., Calardo, E., Rotolo, A., Sartor, G.: Legal responsibility for the acts of others a logical analysis. In: Rules on the Web. From Theory to Applications - 8Th International Symposium, RuleML 2014, Co-Located with the 21St European Conference on Artificial Intelligence, ECAI 2014, August 18-20, 2014. Proceedings, pp. 329\u2013338, Prague (2014)"},{"key":"9632_CR57","doi-asserted-by":"crossref","unstructured":"Truszczy\u0144ski, M: Logic programming for knowledge representation. In: Dahl, V., Niemel\u00e4, I. (eds.) Logic Programming, 23rd Intl. Conference, ICLP 2007, pp 76\u201388. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74610-2_6"},{"key":"9632_CR58","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Branching vs. linear time: Final showdown. In: Proceedings of the 2001 Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001, number 2031 in LNCS, pp. 1\u201322. Springer (2001)","DOI":"10.1007\/3-540-45319-9_1"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09632-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09632-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09632-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T19:15:33Z","timestamp":1587582933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09632-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,24]]},"references-count":58,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9632"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09632-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,24]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}