{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:00:44Z","timestamp":1786978844274,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031271809","type":"print"},{"value":"9783031271816","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27181-6_2","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T23:34:21Z","timestamp":1678404861000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Declarative Approach to\u00a0Contrast Pattern Mining"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5414-5844","authenticated-orcid":false,"given":"Francesca Alessandra","family":"Lisi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2936-0777","authenticated-orcid":false,"given":"Gioacchino","family":"Sterlicchio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). http:\/\/doi.acm.org\/10.1145\/2043174.2043195","DOI":"10.1145\/2043174.2043195"},{"key":"2_CR2","unstructured":"Costantini, S., De Gasperis, G., Olivieri, R.: How answer set programming can help in digital forensic investigation. In: Ancona, D., Maratea, M., Mascardi, V. (eds.) Proceedings of the 30th Italian Conference on Computational Logic, Genova, Italy, 1\u20133 July 2015. CEUR Workshop Proceedings, vol. 1459, pp. 53\u201365. CEUR-WS.org (2015). http:\/\/ceur-ws.org\/Vol-1459\/paper29.pdf"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Costantini, S., De\u00a0Gasperis, G., Olivieri, R.: Digital forensics and investigations meet artificial intelligence. Ann. Math. Artif. Intell. 86(1-3), 193\u2013229 (2019). https:\/\/doi.org\/10.1007\/s10472-019-09632-y","DOI":"10.1007\/s10472-019-09632-y"},{"key":"2_CR4","unstructured":"Costantini, S., Lisi, F.A., Olivieri, R.: DigForASP: a european cooperation network for logic-based AI in digital forensics. In: Casagrande, A., Omodeo, E.G. (eds.) Proceedings of the 34th Italian Conference on Computational Logic, Trieste, Italy, 19\u201321 June 2019. CEUR Workshop Proceedings, vol. 2396, pp. 138\u2013146. CEUR-WS.org (2019). http:\/\/ceur-ws.org\/Vol-2396\/paper34.pdf"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for data mining and machine learning. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7707"},{"key":"2_CR6","unstructured":"Dong, G., Bailey, J.: Contrast Data Mining: Concepts, Algorithms, and Applications. CRC Press, Boca Raton (2012)"},{"key":"2_CR7","unstructured":"Gebser, M., Guyet, T., Quiniou, R., Romero, J., Schaub, T.: Knowledge-based sequence mining with ASP. In: IJCAI 2016\u201325th International Joint Conference on Artificial Intelligence, p. 8. AAAI (2016)"},{"key":"2_CR8","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: preliminary report. arXiv preprint arXiv:1405.3694 (2014)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"key":"2_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., De Raedt, L.: MiningZinc: a declarative framework for constraint-based mining. Artif. Intell. 244, 6\u201329 (2017)","journal-title":"Artif. Intell."},{"key":"2_CR11","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-65406-5_3","volume-title":"Advances in Knowledge Discovery and Management","author":"T Guyet","year":"2018","unstructured":"Guyet, T., Moinard, Y., Quiniou, R., Schaub, T.: Efficiency analysis of ASP encodings for sequential pattern mining tasks. In: Pinaud, B., Guillet, F., Cremilleux, B., de Runz, C. (eds.) Advances in Knowledge Discovery and Management. SCI, vol. 732, pp. 41\u201381. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-65406-5_3"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55\u201386 (2007). https:\/\/doi.org\/10.1007\/s10618-006-0059-1","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-18032-8_52","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S Jabbour","year":"2015","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: Decomposition based SAT encodings for itemset mining problems. In: Cao, T., Lim, E.-P., Zhou, Z.-H., Ho, T.-B., Cheung, D., Motoda, H. (eds.) PAKDD 2015. LNCS (LNAI), vol. 9078, pp. 662\u2013674. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18032-8_52"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Leone, N., et al.: 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, 3\u20137 June 2019, Proceedings. LNCS, vol. 11481, pp. 312\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_23","DOI":"10.1007\/978-3-030-20528-7_23"},{"key":"2_CR15","unstructured":"Lisi, F.A., Sterlicchio, G.: 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\u20131 July 2022. CEUR Workshop Proceedings, vol. 3204, pp. 232\u2013246. CEUR-WS.org (2022). http:\/\/ceur-ws.org\/Vol-3204\/paper_23.pdf"},{"key":"2_CR16","unstructured":"Lisi, F.A., Sterlicchio, G.: Mining sequences in phone recordings with answer set programming. In: Bruno, P., Calimeri, F., Cauteruccio, F., Maratea, M., Terracina, G., Vallati, M. (eds.) HYDRA - RCRA 2022: 1st International Workshop on Hybrid Models for Coupling Deductive and Inductive Reasoning and 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. CEUR Workshop Proceedings. CEUR-WS.org (2022)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-319-18008-3_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Negrevergne","year":"2015","unstructured":"Negrevergne, B., Guns, T.: Constraint-based sequence mining using constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 288\u2013305. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_20"},{"issue":"4","key":"2_CR18","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.: Hybrid ASP-based approach to pattern mining. Theory Pract. Log. Program. 19(4), 505\u2013535 (2019). https:\/\/doi.org\/10.1017\/S1471068418000467","journal-title":"Theory Pract. Log. Program."}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T23:34:31Z","timestamp":1678404871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This proceeding includes one invited paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}