{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:20:32Z","timestamp":1777890032951,"version":"3.51.4"},"reference-count":70,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2024,10,4]]},"abstract":"<jats:p>Given two datasets, i.e., two sets of tuples of constants, representing positive and negative examples, logical separability is the reasoning task of finding a formula in a certain target query language that separates them. As already pointed out in previous works, this task turns out to be relevant in several application scenarios such as concept learning and generating referring expressions. Besides, if we think of the input datasets of positive and negative examples as composed of tuples of constants classified, respectively, positively and negatively by a black-box model, then the separating formula can be used to provide global post-hoc explanations of such a model. In this paper, we study the separability task in the context of Ontology-based Data Management (OBDM), in which a domain ontology provides a high-level, logic-based specification of a domain of interest, semantically linked through suitable mapping assertions to the data source layer of an information system. Since a formula that properly separates (proper separation) two input datasets does not always exist, our first contribution is to propose (best) approximations of the proper separation, called (minimally) complete and (maximally) sound separations. We do this by presenting a general framework for separability in OBDM. Then, in a scenario that uses by far the most popular languages for the OBDM paradigm, our second contribution is a comprehensive study of three natural computational problems associated with the framework, namely Verification (check whether a given formula is a proper, complete, or sound separation of two given datasets), Existence (check whether a proper, or best approximated separation of two given datasets exists at all), and Computation (compute any proper, or any best approximated separation of two given datasets).<\/jats:p>","DOI":"10.3233\/sw-233391","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T10:40:56Z","timestamp":1686307256000},"page":"1021-1056","source":"Crossref","is-referenced-by-count":1,"title":["Separability and Its Approximations in Ontology-based Data Management"],"prefix":"10.1177","volume":"15","author":[{"given":"Gianluca","family":"Cima","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Croce","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Lenzerini","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/SW-233391_ref1","unstructured":"S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison Wesley Publ. Co., 1995."},{"issue":"4","key":"10.3233\/SW-233391_ref2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1987","journal-title":"Machine Learning"},{"key":"10.3233\/SW-233391_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2886095"},{"key":"10.3233\/SW-233391_ref4","doi-asserted-by":"crossref","unstructured":"M. Arenas, G.I. Diaz and E.V. Kostylev, Reverse engineering SPARQL queries, in: Proceedings of the 25th International Conference on World Wide Web, 2016.","DOI":"10.1145\/2872427.2882989"},{"key":"10.3233\/SW-233391_ref5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.2820","article-title":"The DL-lite family and relations","volume":"36","author":"Artale","year":"2009","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.3233\/SW-233391_ref6","unstructured":"F. Baader, D. Calvanese, D. McGuinness, D. Nardi and P.F. Patel-Schneider (eds), The Description Logic Handbook: Theory, Implementation and Applications, Cambridge University Press, 2003."},{"key":"10.3233\/SW-233391_ref7","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2017.7"},{"key":"10.3233\/SW-233391_ref8","doi-asserted-by":"crossref","unstructured":"A. Bondy and M.R. Murty, Graph Theory, Graduate Texts in Mathematics, Springer, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"10.3233\/SW-233391_ref9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.artint.2016.01.010","article-title":"Games for query inseparability of description logic knowledge bases","volume":"234","author":"Botoeva","year":"2016","journal-title":"Artificial Intelligence"},{"issue":"C","key":"10.3233\/SW-233391_ref10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.09.003","article-title":"Query inseparability for ALC ontologies","volume":"272","author":"Botoeva","year":"2019","journal-title":"Artif. Intell."},{"key":"10.3233\/SW-233391_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186235"},{"issue":"1","key":"10.3233\/SW-233391_ref12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(91)90075-D","article-title":"On truth-table reducibility to SAT","volume":"91","author":"Buss","year":"1991","journal-title":"Information and Computation"},{"key":"10.3233\/SW-233391_ref13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1613\/jair.3873","article-title":"Taming the infinite chase: Query answering under expressive relational constraints","volume":"48","author":"Cal\u00ec","year":"2013","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"10.3233\/SW-233391_ref14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3233\/SW-2011-0029","article-title":"The mastro system for ontology-based data access","volume":"2","author":"Calvanese","year":"2011","journal-title":"Semantic Web Journal"},{"issue":"3","key":"10.3233\/SW-233391_ref15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","article-title":"Tractable reasoning and efficient query answering in description logics: The DL-lite family","volume":"39","author":"Calvanese","year":"2007","journal-title":"Journal of Automated Reasoning"},{"key":"10.3233\/SW-233391_ref16","unstructured":"D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini and R. Rosati, EQL-Lite: Effective first-order query processing in description logics, in: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), 2007, pp. 274\u2013279."},{"issue":"2","key":"10.3233\/SW-233391_ref17","first-page":"61","article-title":"Query processing under GLAV mappings for relational and graph databases","volume":"6","author":"Calvanese","year":"2012","journal-title":"Proceedings of the Very Large Database Endowment"},{"key":"10.3233\/SW-233391_ref18","unstructured":"G. Cima, Preliminary results on ontology-based open data publishing, in: Proceedings of the Thirtieth International Workshop on Description Logics (DL 2017), CEUR Electronic Workshop Proceedings, Vol. 1879, 2017. http:\/\/ceur-ws.org\/."},{"key":"10.3233\/SW-233391_ref19","doi-asserted-by":"crossref","unstructured":"G. Cima, Abstraction in Ontology-Based Data Management, Frontiers in Artificial Intelligence and Applications, Vol. 348, IOS Press, 2022.","DOI":"10.3233\/FAIA348"},{"key":"10.3233\/SW-233391_ref20","doi-asserted-by":"crossref","unstructured":"G. Cima, M. Console, M. Lenzerini and A. Poggi, Abstraction in data integration, in: Proceedings of the Thirty-Sixth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2021), IEEE, 2021, pp. 1\u201311.","DOI":"10.1109\/LICS52264.2021.9470716"},{"key":"10.3233\/SW-233391_ref21","doi-asserted-by":"crossref","unstructured":"G. Cima, M. Console, M. Lenzerini and A. Poggi, Monotone abstractions in ontology-based data management, in: Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2022), 2022, pp. 5556\u20135563.","DOI":"10.1609\/aaai.v36i5.20495"},{"key":"10.3233\/SW-233391_ref22","doi-asserted-by":"crossref","unstructured":"G. Cima, F. Croce and M. Lenzerini, Query definability and its approximations in ontology-based data management, in: CIKM\u201921: The 30th ACM International Conference on Information and Knowledge Management, ACM, 2021.","DOI":"10.1145\/3459637.3482466"},{"key":"10.3233\/SW-233391_ref23","doi-asserted-by":"crossref","unstructured":"G. Cima, M. Lenzerini and A. Poggi, Semantic characterization of data services through ontologies, in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019), 2019, pp. 1647\u20131653.","DOI":"10.24963\/ijcai.2019\/228"},{"key":"10.3233\/SW-233391_ref24","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/25"},{"key":"10.3233\/SW-233391_ref25","doi-asserted-by":"crossref","unstructured":"G. Ciravegna, F. Giannini, M. Gori, M. Maggini and S. Melacci, Human-driven FOL explanations of deep learning, in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, 2020.","DOI":"10.24963\/ijcai.2020\/309"},{"key":"10.3233\/SW-233391_ref26","doi-asserted-by":"crossref","unstructured":"R. Confalonieri, T. Weyde, T.R. Besold and F.M. del Prado Mart\u00edn, Using ontologies to enhance human understandability of global post-hoc explanations of black-box models, Artif. Intell. (2021).","DOI":"10.1016\/j.artint.2021.103471"},{"key":"10.3233\/SW-233391_ref27","unstructured":"A. Doan, A.Y. Halevy and Z.G. Ives, Principles of Data Integration, Morgan Kaufmann, 2012. ISBN 978-0-12-416044-6."},{"issue":"1","key":"10.3233\/SW-233391_ref28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","article-title":"Data exchange: Semantics and query answering","volume":"336","author":"Fagin","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/SW-233391_ref29","unstructured":"M. Friedman, A. Levy and T. Millstein, Navigational plans for data integration, in: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI 1999), AAAI Press, 1999, pp. 67\u201373."},{"key":"10.3233\/SW-233391_ref30","doi-asserted-by":"crossref","unstructured":"M. Funk, J.C. Jung and C. Lutz, Frontiers and exact learning of ELI queries under DL-lite ontologies, in: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022, pp. 2627\u20132633.","DOI":"10.24963\/ijcai.2022\/364"},{"key":"10.3233\/SW-233391_ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/233"},{"issue":"3","key":"10.3233\/SW-233391_ref32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/SW-233391_ref33","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2015.06.002","article-title":"Queries with negation and inequalities over lightweight ontologies","volume":"35","author":"Gutierrez-Basulto\u00b4","year":"2015","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-233391_ref34","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/255"},{"key":"10.3233\/SW-233391_ref35","unstructured":"I. Horrocks, O. Kutz and U. Sattler, The even more irresistible SROIQ, in: Proceedings of the Tenth International Conference on the Principles of Knowledge Representation and Reasoning (KR 2006), 2006, pp. 57\u201367."},{"key":"10.3233\/SW-233391_ref36","doi-asserted-by":"crossref","unstructured":"I. Horrocks, U. Sattler and S. Tobies, Reasoning with individuals for the description logic SHIQ, in: Proceedings of the Seventeenth International Conference on Automated Deduction (CADE 2000), D. McAllester, ed., Lecture Notes in Computer Science, Vol. 1831, Springer, 2000, pp. 482\u2013496.","DOI":"10.1007\/10721959_39"},{"key":"10.3233\/SW-233391_ref37","doi-asserted-by":"crossref","unstructured":"J.C. Jung, C. Lutz, H. Pulcini and F. Wolter, Logical separability of incomplete data under ontologies, in: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, 2020.","DOI":"10.24963\/kr.2020\/52"},{"key":"10.3233\/SW-233391_ref38","doi-asserted-by":"crossref","unstructured":"J.C. Jung, C. Lutz, H. Pulcini and F. Wolter, Separating data examples by description logic concepts with restricted signatures, in: Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning, International Joint Conferences on Artificial Intelligence Organization, 2021.","DOI":"10.24963\/kr.2021\/37"},{"key":"10.3233\/SW-233391_ref39","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2021\/37"},{"key":"10.3233\/SW-233391_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103785"},{"key":"10.3233\/SW-233391_ref41","doi-asserted-by":"crossref","unstructured":"D.V. Kalashnikov, L.V.S. Lakshmanan and D. Srivastava, FastQRE: Fast query reverse engineering, in: Proceedings of the 2018 International Conference on Management of Data, Association for Computing Machinery, 2018.","DOI":"10.1145\/3183713.3183727"},{"key":"10.3233\/SW-233391_ref42","doi-asserted-by":"crossref","unstructured":"B. Konev, A. Ozaki and F. Wolter, A model for learning description logic ontologies based on exact learning, in: AAAI, 2016.","DOI":"10.1609\/aaai.v30i1.10087"},{"key":"10.3233\/SW-233391_ref43","doi-asserted-by":"crossref","unstructured":"M. Law, A. Russo and K. Broda, Inductive learning of answer set programs, in: Logics in Artificial Intelligence, 2014.","DOI":"10.1007\/978-3-319-11558-0_22"},{"key":"10.3233\/SW-233391_ref44","doi-asserted-by":"crossref","unstructured":"J. Lehmann and P. Hitzler, Concept learning in description logics using refinement operators, Mach. Learn. (2010).","DOI":"10.1007\/s10994-009-5146-2"},{"key":"10.3233\/SW-233391_ref45","doi-asserted-by":"crossref","unstructured":"M. Lenzerini, Data integration: A theoretical perspective, in: Proceedings of the Twentyfirst ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2002), 2002, pp. 233\u2013246.","DOI":"10.1145\/543613.543644"},{"key":"10.3233\/SW-233391_ref46","doi-asserted-by":"crossref","unstructured":"M. Lenzerini, Ontology-based data management, in: Proceedings of the 20th ACM Conference on Information and, Knowledge Management, CIKM, 2011.","DOI":"10.1145\/2063576.2063582"},{"key":"10.3233\/SW-233391_ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063582"},{"issue":"2","key":"10.3233\/SW-233391_ref48","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1609\/aimag.v39i2.2802","article-title":"Managing data through the lens of an ontology","volume":"39","author":"Lenzerini","year":"2018","journal-title":"AI Magazine"},{"key":"10.3233\/SW-233391_ref49","unstructured":"J. Liartis, E. Dervakos, O.M. Mastromichalakis, A. Chortaras and G. Stamou, Semantic queries explaining opaque machine learning classifiers, in: Proceedings of the Workshop on Data Meets Applied Ontologies in Explainable AI, 2021."},{"key":"10.3233\/SW-233391_ref50","unstructured":"C. Lutz, J. Marti and L. Sabellek, Query expressibility and verification in ontology-based data access, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR 2018), 2018, pp. 389\u2013398."},{"key":"10.3233\/SW-233391_ref51","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.is.2019.03.002","article-title":"Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities","volume":"83","author":"Martins","year":"2019","journal-title":"Information Systems"},{"key":"10.3233\/SW-233391_ref52","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.is.2019.03.002","article-title":"Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities","volume":"83","author":"Martins","year":"2019","journal-title":"Information Systems"},{"key":"10.3233\/SW-233391_ref53","unstructured":"B. Motik, B. Cuenca Grau, I. Horrocks, Z. Wu, A. Fokoue and C. Lutz, OWL 2 Web Ontology Language Profiles (Second Edition), W3C Recommendation, World Wide Web Consortium, 2012, available at http:\/\/www.w3.org\/TR\/owl2-profiles\/."},{"issue":"12","key":"10.3233\/SW-233391_ref54","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.14778\/3137765.3137824","article-title":"New trends on exploratory methods for data analytics","volume":"10","author":"Mottin","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"10.3233\/SW-233391_ref55","doi-asserted-by":"crossref","unstructured":"M. Ortiz, Ontology-mediated queries from examples: A glimpse at the DL-Lite case, in: Proceedings of the Fifth Global Conference on Artificial Intelligence, EPiC Series in Computing, Vol. 65, 2019, pp. 1\u201314.","DOI":"10.29007\/jhtz"},{"issue":"2","key":"10.3233\/SW-233391_ref56","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"10.3233\/SW-233391_ref57","unstructured":"C. Persia, A. Ozaki and A. Mazzullo, Learning query inseparable ELH ontologies, in: AAAI, 2019."},{"key":"10.3233\/SW-233391_ref58","first-page":"133","article-title":"Linking data to ontologies","volume":"X","author":"Poggi","year":"2008","journal-title":"Journal on Data Semantics"},{"issue":"1","key":"10.3233\/SW-233391_ref59","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(03)00229-1","article-title":"Exact complexity of exact-four-colorability","volume":"87","author":"Rothe","year":"2003","journal-title":"Information Processing Letters"},{"key":"10.3233\/SW-233391_ref60","unstructured":"M.K. Sarker, N. Xie, D. Doran, M. Raymer and P. Hitzler, Explaining trained neural networks with Semantic Web technologies: First steps, in: Proceedings of the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning, 2017."},{"issue":"1","key":"10.3233\/SW-233391_ref61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.3233\/SW-233391_ref62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/SW-233391_ref63","unstructured":"B. ten Cate and V. Dalmau, The product homomorphism problem and applications, in: Proceedings of the Eigthteenth International Conference on Database Theory (ICDT 2015), LIPIcs, Vol. 31, 2015, pp. 161\u2013176."},{"key":"10.3233\/SW-233391_ref64","unstructured":"B. ten Cate and V. Dalmau, Conjunctive queries: Unique characterizations and exact learnability, in: 24th International Conference on Database Theory (ICDT 2021), Vol. 186, 2021."},{"key":"10.3233\/SW-233391_ref65","doi-asserted-by":"crossref","unstructured":"Q.T. Tran, C.-Y. Chan and S. Parthasarathy, Query Reverse Engineering, The VLDB Journal 23(5) (2014).","DOI":"10.1007\/s00778-013-0349-3"},{"key":"10.3233\/SW-233391_ref66","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"51","author":"Wagner","year":"1987","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"10.3233\/SW-233391_ref67","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM Journal on Computing"},{"key":"10.3233\/SW-233391_ref68","doi-asserted-by":"crossref","unstructured":"Y.Y. Weiss and S. Cohen, Reverse engineering SPJ-queries from examples, in: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017.","DOI":"10.1145\/3034786.3056112"},{"key":"10.3233\/SW-233391_ref69","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1613\/jair.1.11345","article-title":"Viewpoint: Human-in-the-loop artificial intelligence","volume":"64","author":"Zanzotto","year":"2019","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.3233\/SW-233391_ref70","doi-asserted-by":"publisher","DOI":"10.1145\/1282480.1282482"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-233391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:27:02Z","timestamp":1777613222000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-233391"}},"subtitle":[],"editor":[{"given":"Roberto","family":"Confalonieri","sequence":"additional","affiliation":[{"name":"University of Padua, Italy"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Oliver","family":"Kutz","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano, Italy"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Diego","family":"Calvanese","sequence":"additional","affiliation":[{"name":"Ume\u00e5 University, Sweden and Free University of Bozen-Bolzano, Italy"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Jose M.","family":"Alonso","sequence":"additional","affiliation":[{"name":"University of Santiago de Compostela, CiTIUS, Spain"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Shang-Ming","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Plymouth, UK"}],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,10,4]]},"references-count":70,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/sw-233391","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2024,10,4]]}}}