{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:53Z","timestamp":1773656453054,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319574530","type":"print"},{"value":"9783319574547","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57454-7_64","type":"book-chapter","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T12:09:31Z","timestamp":1492862971000},"page":"824-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Enumerating Non-redundant Association Rules Using Satisfiability"],"prefix":"10.1007","author":[{"given":"Abdelhamid","family":"Boudane","sequence":"first","affiliation":[]},{"given":"Said","family":"Jabbour","sequence":"additional","affiliation":[]},{"given":"Lakhdar","family":"Sais","sequence":"additional","affiliation":[]},{"given":"Yakoub","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"64_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic \u2014 CL 2000","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L.M., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972\u2013986. Springer, Heidelberg (2000). doi:10.1007\/3-540-44957-4_65"},{"key":"64_CR3","unstructured":"Boudane, A., Jabbour, S., Sais, L., Salhi, Y.: A sat-based approach for mining association rules. In: Proceedings of IJCAI 2016, pp. 2472\u20132478 (2016)"},{"issue":"1","key":"64_CR4","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomaric, A., Gueniche, T., Soltani, A., Wu, C.-W., Tseng, V.S.: SPMF: a java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389\u20133393 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Tseng, V.S.: TNS: mining top-k non-redundant sequential rules. In: Proceedings of SAC 2013, pp 164\u2013166 (2013)","DOI":"10.1145\/2480362.2480395"},{"key":"64_CR6","doi-asserted-by":"crossref","unstructured":"Gasmi, G., Yahia, S.B., Nguifo, E.M., Slimani, Y.: IGB: a new informative generic base of association rules. In: Proceedings of PAKDD 2005, pp. 81\u201390 (2005)","DOI":"10.1007\/11430919_11"},{"issue":"12\u201313","key":"64_CR7","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns, T., Nijssen, S., Raedt, L.D.: Itemset mining: a constraint programming perspective. Artif. Intell. 175(12\u201313), 1951\u20131983 (2011)","journal-title":"Artif. Intell."},{"key":"64_CR8","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns, T., Nijssen, S., Raedt, L.D.: k-pattern set mining under constraints. IEEE Trans. Knowl. Data Eng. 25, 402\u2013418 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: The top-k frequent closed itemset mining using top-k sat problem. In: Proceedings of ECML\/PKDD 2013, pp. 403\u2013418 (2013)","DOI":"10.1007\/978-3-642-40994-3_26"},{"key":"64_CR10","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). doi:10.1007\/978-3-319-18032-8_52"},{"key":"64_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-20895-9_35","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M J\u00e4rvisalo","year":"2011","unstructured":"J\u00e4rvisalo, M.: Itemset mining as a challenge application for answer set enumeration. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 304\u2013310. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20895-9_35"},{"key":"64_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-15396-9_44","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"M Khiari","year":"2010","unstructured":"Khiari, M., Boizumault, P., Cr\u00e9milleux, B.: Constraint programming for mining n-ary patterns. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 552\u2013567. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15396-9_44"},{"key":"64_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-64383-4_17","volume-title":"Research and Development in Knowledge Discovery and Data Mining","author":"M Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Representative association rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 198\u2013209. Springer, Heidelberg (1998). doi:10.1007\/3-540-64383-4_17"},{"key":"64_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0094839","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"M Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Representative association rules and minimum condition maximum consequence association rules. In: \u017bytkow, J.M., Quafafou, M. (eds.) PKDD 1998. LNCS, vol. 1510, pp. 361\u2013369. Springer, Heidelberg (1998). doi:10.1007\/BFb0094839"},{"key":"64_CR15","doi-asserted-by":"crossref","unstructured":"M\u00e9tivier, J., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., Loudni, S.: A constraint language for declarative pattern discovery. In: Proceedings of SAC 2012, pp. 119\u2013125 (2012)","DOI":"10.1145\/2245276.2245302"},{"key":"64_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). doi:10.1007\/11564751_73"},{"key":"64_CR17","unstructured":"Szathmary, L., Napoli, A., Kuznetsov, S.O.: ZART: a multifunctional itemset mining algorithm. In: Proceedings of ICCLTA 2007 (2007)"},{"key":"64_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Discov. 9, 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57454-7_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:45:53Z","timestamp":1750203953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57454-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319574530","9783319574547"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57454-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","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":"pakdd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd2017.snu.ac.kr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}