{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T17:23:22Z","timestamp":1789233802061,"version":"build-2803163510"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Politecnico di Bari"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we present MASS-CSP (Mining with Answer Set Solving - Contrast Sequential Patterns), a declarative approach to the Contrast Sequential Pattern Mining (CSPM) task, which is based on the logic-based framework of Answer Set Programming (ASP). The CSPM task focuses on identifying significant differences in frequent sequences relative to specific classes, leading to the concept of a contrast sequential pattern. The article describes how MASS-CSP addresses the CSPM task and related extensions-mining closed, maximal and constrained patterns. Evaluation aims at comparing the basic version of MASS-CSP against the extended versions as regards the size of output and time-memory requirements.<\/jats:p>","DOI":"10.1007\/s10994-025-06876-0","type":"journal-article","created":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:59:48Z","timestamp":1759093188000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["MASS-CSP: mining with answer set solving for contrast sequential pattern mining"],"prefix":"10.1007","volume":"114","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2936-0777","authenticated-orcid":false,"given":"Gioacchino","family":"Sterlicchio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5414-5844","authenticated-orcid":false,"given":"Francesca Alessandra","family":"Lisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,28]]},"reference":[{"key":"6876_CR1","doi-asserted-by":"publisher","unstructured":"Arif, M.F., Larraz, D., Echeverria, M., Reynolds, A., Chowdhury, O. & Tinelli, C. (2020). Syslite: Syntax-guided synthesis of PLTL formulas from finite traces. In: 2020 Formal Methods in Computer Aided Design (FMCAD), (pp. 93\u2013103). https:\/\/doi.org\/10.34727\/2020\/isbn.978-3-85448-042-6_16.","DOI":"10.34727\/2020\/isbn.978-3-85448-042-6_16"},{"key":"6876_CR2","unstructured":"Besnard, P. & Guyet, T. (2020). Declarative mining of negative sequential patterns. In: DPSW 2020-1st Declarative Problem Solving Workshop, (pp. 1\u20138)."},{"issue":"12","key":"6876_CR3","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. (2011). Answer set programming at a glance. Communications of the ACM, 54(12), 92\u2013103. https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Communications of the ACM"},{"key":"6876_CR4","doi-asserted-by":"publisher","unstructured":"Chen, Y., Gan, W., Wu, Y. & Yu, P.S. (2022). Contrast pattern mining: A survey. CoRR abs\/2209.13556. https:\/\/doi.org\/10.48550\/ARXIV.2209.13556.","DOI":"10.48550\/ARXIV.2209.13556"},{"key":"6876_CR5","doi-asserted-by":"publisher","unstructured":"Coquery, E., Jabbour, S., Sa\u00efs, L. & Salhi, Y. (2012). A sat-based approach for discovering frequent, closed and maximal patterns in a sequence. In: Raedt, L.D., Bessiere, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P.J.F. (eds.) ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012. Frontiers in Artificial Intelligence and Applications, (Vol. 242, pp. 258\u2013263). IOS Press, Amsterdam. https:\/\/doi.org\/10.3233\/978-1-61499-098-7-258.","DOI":"10.3233\/978-1-61499-098-7-258"},{"key":"6876_CR6","volume-title":"Contrast Data Mining: Concepts, Algorithms, and Applications","author":"G Dong","year":"2013","unstructured":"Dong, G., & Bailey, J. (2013). Contrast Data Mining: Concepts, Algorithms, and Applications. CRC Press."},{"key":"6876_CR7","unstructured":"Gebser, M., Guyet, T., Quiniou, R., Romero, J. & Schaub, T. (2016). Knowledge-based sequence mining with ASP. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York 2016, (pp. 1497\u20131504). IJCAI\/AAAI Press, USA. http:\/\/www.ijcai.org\/Abstract\/16\/215."},{"key":"6876_CR8","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B. & Schaub, T. (2014). Clingo = ASP + control: Preliminary report. CoRR abs\/1405.3694. arXiv:1405.3694."},{"issue":"3\/4","key":"6876_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., & Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Gener. Comput., 9(3\/4), 365\u2013386. https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New Gener. Comput."},{"key":"6876_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/J.ARTINT.2015.09.007","volume":"244","author":"T Guns","year":"2017","unstructured":"Guns, T., Dries, A., Nijssen, S., Tack, G., & Raedt, L. D. (2017). Miningzinc: A declarative framework for constraint-based mining. Artificial Intelligence, 244, 6\u201329. https:\/\/doi.org\/10.1016\/J.ARTINT.2015.09.007","journal-title":"Artificial Intelligence"},{"key":"6876_CR11","unstructured":"Guyet, T. (2020). Enhancing sequential pattern mining with time and reasoning. Habilitation \u00e0 diriger des recherches, Universit\u00e9 de Rennes 1 (2020). https:\/\/theses.hal.science\/tel-02495270."},{"key":"6876_CR12","doi-asserted-by":"publisher","unstructured":"Guyet, T., Happe, A. & Dauxais, Y. (2017). Declarative sequential pattern mining of care pathways. In: Teije, A., Popow, C., Holmes, J.H., Sacchi, L. (eds.) Artificial Intelligence in Medicine - 16th Conference on Artificial Intelligence in Medicine, AIME 2017, Vienna, Austria, June 21-24 2017. Proceedings. Lecture Notes in Computer Science, (Vol. 10259, pp. 261\u2013266). Springer, Cham . https:\/\/doi.org\/10.1007\/978-3-319-59758-4_29","DOI":"10.1007\/978-3-319-59758-4_29"},{"key":"6876_CR13","unstructured":"Guyet, T., Moinard, Y. & Quiniou, R. (2014). Using answer set programming for pattern mining. CoRR abs\/1409.7777. arXiv:1409.7777."},{"key":"6876_CR14","doi-asserted-by":"publisher","unstructured":"Guyet, T., Moinard, Y., Quiniou, R. & Schaub, T. (2016). Efficiency analysis of ASP encodings for sequential pattern mining tasks. In: Pinaud, B., Guillet, F., Cr\u00e9milleux, B., Runz, C. (eds.) Advances in Knowledge Discovery and Management - Volume 7 [Best of EGC 2016,Reims, France]. Studies in Computational Intelligence, (Vol. 732, pp. 41\u201381). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-65406-5_3.","DOI":"10.1007\/978-3-319-65406-5_3"},{"key":"6876_CR15","unstructured":"Han, J., Pei, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U. & Hsu, M. (2001). Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering, (pp. 215\u2013224) . IEEE."},{"key":"6876_CR16","doi-asserted-by":"publisher","unstructured":"Jabbour, S., Sais, L. & Salhi, Y. (2015). Decomposition based SAT encodings for itemset mining problems. In: Cao, T.H., Lim, E., Zhou, Z., Ho, T.B., Cheung, D.W., Motoda, H. (eds.) Advances in Knowledge Discovery and Data Mining - 19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part II. Lecture Notes in Computer Science, (Vol. 9078, pp. 662\u2013674). Springer, Cham . https:\/\/doi.org\/10.1007\/978-3-319-18032-8_52.","DOI":"10.1007\/978-3-319-18032-8_52"},{"key":"6876_CR17","doi-asserted-by":"publisher","unstructured":"J\u00e4rvisalo, M. (2011). Itemset mining as a challenge application for answer set enumeration. In: Delgrande, J.P., Faber, W. (eds.) Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings. Lecture Notes in Computer Science, (Vol. 6645, pp. 304\u2013310). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-642-20895-9_35.","DOI":"10.1007\/978-3-642-20895-9_35"},{"key":"6876_CR18","doi-asserted-by":"publisher","unstructured":"Leone, N., Allocca, C., Alviano, M., Calimeri, F., Civili, C., Costabile, R., Fiorentino, A., Fusc\u00e0, D., Germano, S., Laboccetta, G., Cuteri, B., Manna, M., Perri, S., Reale, K., Ricca, F., Veltri, P. & Zangari, J. (2019). Enhancing DLV for large-scale reasoning. In: Balduccini, M., Lierler, Y., Woltran, S. (eds.) Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings. Lecture Notes in Computer Science, (Vol. 11481, pp. 312\u2013325). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-20528-7_23","DOI":"10.1007\/978-3-030-20528-7_23"},{"issue":"3","key":"6876_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1609\/AIMAG.V37I3.2670","volume":"37","author":"V Lifschitz","year":"2016","unstructured":"Lifschitz, V. (2016). Answer sets and the language of answer set programming. AI Mag., 37(3), 7\u201312. https:\/\/doi.org\/10.1609\/AIMAG.V37I3.2670","journal-title":"AI Mag."},{"key":"6876_CR20","doi-asserted-by":"publisher","unstructured":"Lisi, F.A. & Sterlicchio, G. (2022). A declarative approach to contrast pattern mining. In: Dovier, A., Montanari, A., Orlandini, A. (eds.) AIxIA 2022 - Advances in Artificial Intelligence - XXIst International Conference of the Italian Association for Artificial Intelligence, AIxIA 2022, Udine, Italy, November 28 - December 2, 2022, Proceedings. Lecture Notes in Computer Science, (Vol. 13796, pp. 17\u201330). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-27181-6_2.","DOI":"10.1007\/978-3-031-27181-6_2"},{"key":"6876_CR21","unstructured":"Lisi, F.A. & Sterlicchio, G. (2022). Declarative pattern mining in digital forensics: Preliminary results. In: Calegari, R., Ciatto, G., Omicini, A. (eds.) Proceedings of the 37th Italian Conference on Computational Logic, Bologna, Italy, June 29 - July 1, 2022. CEUR Workshop Proceedings, (Vol. 3204, pp. 232\u2013246). CEUR-WS.org, Germany. https:\/\/ceur-ws.org\/Vol-3204\/paper_23.pdf."},{"key":"6876_CR22","unstructured":"Lisi, F.A. & Sterlicchio, G. (2022). Mining sequences in phone recordings with Answer Set Programming. In: Bruno, P., Calimeri, F., Cauteruccio, F., Maratea, M., Terracina, G., Vallati, M. (eds.) Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HYDRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) Co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), Genova Nervi, Italy, September 5, 2022. CEUR Workshop Proceedings, (Vol. 3281, pp. 34\u201350). CEUR-WS.org, ??? . http:\/\/ceur-ws.org\/Vol-3281\/paper4.pdf."},{"key":"6876_CR23","doi-asserted-by":"publisher","unstructured":"Lisi, F.A. & Sterlicchio, G. (2023). Mining contrast sequential patterns with ASP. In: Basili, R., Lembo, D., Limongelli, C., Orlandini, A. (eds.) AIxIA 2023 - Advances in Artificial Intelligence - XXIInd International Conference of the Italian Association for Artificial Intelligence, AIxIA 2023, Rome, Italy, November 6-9, 2023, Proceedings. Lecture Notes in Computer Science, (Vol. 14318, pp. 44\u201357). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-47546-7_4.","DOI":"10.1007\/978-3-031-47546-7_4"},{"key":"6876_CR24","unstructured":"M\u00e9tivier, J., Loudni, S. & Charnois, T. (2013) . A constraint programming approach for mining sequential patterns in a sequence database. CoRR abs\/1311.6907 arXiv:1311.6907."},{"issue":"2","key":"6876_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2431211.2431218","volume":"45","author":"C Mooney","year":"2013","unstructured":"Mooney, C., & Roddick, J. F. (2013). Sequential pattern mining - Approaches and algorithms. ACM Computing Surveys, 45(2), 19\u201311939. https:\/\/doi.org\/10.1145\/2431211.2431218","journal-title":"ACM Computing Surveys"},{"key":"6876_CR26","doi-asserted-by":"publisher","unstructured":"N\u00e9grevergne, B. & Guns, T. (2015). Constraint-based sequence mining using constraint programming. In: Michel, L. (ed.) Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings. Lecture Notes in Computer Science, (Vol. 9075, pp. 288\u2013305). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-18008-3_20.","DOI":"10.1007\/978-3-319-18008-3_20"},{"issue":"4","key":"6876_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1017\/S1471068418000467","volume":"19","author":"S Paramonov","year":"2019","unstructured":"Paramonov, S., Stepanova, D., & Miettinen, P. (2019). Hybrid ASP-based approach to pattern mining. Theory Pract. Log. Program., 19(4), 505\u2013535. https:\/\/doi.org\/10.1017\/S1471068418000467","journal-title":"Theory Pract. Log. Program."},{"key":"6876_CR28","doi-asserted-by":"publisher","unstructured":"Pei, J., Han, J. & Wang, W. (2002). Mining sequential patterns with constraints in large databases. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management. CIKM \u201902, pp. 18\u201325. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/584792.584799.","DOI":"10.1145\/584792.584799"},{"issue":"2","key":"6876_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/S10844-006-0006-Z","volume":"28","author":"J Pei","year":"2007","unstructured":"Pei, J., Han, J., & Wang, W. (2007). Constraint-based sequential pattern mining: The pattern-growth methods. Journal of Intelligent Information Systems, 28(2), 133\u2013160. https:\/\/doi.org\/10.1007\/S10844-006-0006-Z","journal-title":"Journal of Intelligent Information Systems"},{"key":"6876_CR30","unstructured":"Samet, A., Guyet, T. & N\u00e9grevergne, B. (2017). Mining rare sequential patterns with ASP. In: Lachiche, N., Vrain, C. (eds.) Late Breaking Papers of the 27th International Conference on Inductive Logic Programming, Orl\u00e9ans, France, September 4-6, 2017. CEUR Workshop Proceedings, (Vol. 2085, pp. 51\u201360). CEUR-WS.org, Germany. https:\/\/ceur-ws.org\/Vol-2085\/sametLBP-ILP2017.pdf."},{"key":"6876_CR31","unstructured":"Sterlicchio, G. & Lisi, F.A. (2024). Condensed representations for contrast sequential pattern mining in ASP. In: Angelis, E.D., Proietti, M. (eds.) Proceedings of the 39th Italian Conference on Computational Logic, Rome, Italy, June 26-28, 2024. CEUR Workshop Proceedings, Vol. 3733. CEUR-WS.org, Germany. https:\/\/ceur-ws.org\/Vol-3733\/short1.pdf."},{"key":"6876_CR32","doi-asserted-by":"publisher","unstructured":"Sterlicchio, G. & Lisi, F.A. (2024). Detecting patterns of attacks to network security in urban air mobility with answer set programming. In: Endriss, U., Melo, F.S., Bach, K., Diz, A.J.B., Alonso-Moral, J.M., Barro, S., Heintz, F. (eds.) ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain - Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024). Frontiers in Artificial Intelligence and Applications, (Vol. 392, pp. 1285\u20131292). IOS Press, Amsterdam. https:\/\/doi.org\/10.3233\/FAIA240626.","DOI":"10.3233\/FAIA240626"},{"issue":"11","key":"6876_CR33","doi-asserted-by":"publisher","first-page":"11819","DOI":"10.1109\/TCYB.2021.3082114","volume":"52","author":"Y Wu","year":"2022","unstructured":"Wu, Y., Wang, Y., Li, Y., Zhu, X., & Wu, X. (2022). Top-k self-adaptive contrast sequential pattern mining. IEEE Transactions on Cybernetics, 52(11), 11819\u201311833. https:\/\/doi.org\/10.1109\/TCYB.2021.3082114","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"4","key":"6876_CR34","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/S11280-015-0350-4","volume":"19","author":"Z Zheng","year":"2016","unstructured":"Zheng, Z., Wei, W., Liu, C., Cao, W., Cao, L., & Bhatia, M. (2016). An effective contrast sequential pattern mining approach to taxpayer behavior analysis. World Wide Web, 19(4), 633\u2013651. https:\/\/doi.org\/10.1007\/S11280-015-0350-4","journal-title":"World Wide Web"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06876-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06876-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06876-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:29:21Z","timestamp":1764685761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06876-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":34,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["6876"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06876-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"2 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"235"}}