{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:23:47Z","timestamp":1764689027472,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180311"},{"type":"electronic","value":"9783319180328"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-18032-8_52","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T05:41:54Z","timestamp":1431063714000},"page":"662-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Decomposition Based SAT Encodings for Itemset Mining Problems"],"prefix":"10.1007","author":[{"given":"Said","family":"Jabbour","sequence":"first","affiliation":[]},{"given":"Lakhdar","family":"Sais","sequence":"additional","affiliation":[]},{"given":"Yakoub","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"issue":"2","key":"52_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10601-010-9105-0","volume":"16","author":"R Asin","year":"2011","unstructured":"Asin, R., Nieuwenhuis, R., Oliveras, A., Rodriguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195\u2013221 (2011)","journal-title":"Constraints"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Cambazard, H., Hadzic, T., O\u2019Sullivan, B.: Knowledge compilation for itemset mining. In: ECAI 2010, pp. 1109\u20131110 (2010)","DOI":"10.3233\/978-1-60750-606-5-1109"},{"key":"52_CR3","unstructured":"Guns, T., Dries, A., Tack, G., Nijssen, S., De Raedt, L.: Miningzinc: A modeling language for constraint-based mining. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 1365\u20131372 (2013)"},{"issue":"12\u201313","key":"52_CR4","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., De Raedt, L.: Itemset mining: A constraint programming perspective. Artificial Intelligence 175(12\u201313), 1951\u20131983 (2011)","journal-title":"Artificial Intelligence"},{"issue":"12\u201313","key":"52_CR5","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":"52_CR6","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Lonlac, J., Sais, L., Salhi, Y.: Extending modern sat solvers for models enumeration. In: Proceedings of the 11th IEEE International Conference on Information Reuse and Integration (IEEE-IRI 2014), San Francisco, 13\u201315 September 2014 (2014) (to appear). http:\/\/arxiv.org\/abs\/1305.0574, CoRR 2013","DOI":"10.1109\/IRI.2014.7051971"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: The top-k frequent closed itemset mining using top-k sat problem. In: European Conference on Machine Learning and Knowledge Discovery in Databases (ECML\/PKDD 2013), pp. 403\u2013418 (2013)","DOI":"10.1007\/978-3-642-40994-3_26"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-12165-4_35","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2010","author":"M Khiari","year":"2010","unstructured":"Khiari, M., Boizumault, P., Cr\u00e9milleux, B.: Combining csp and constraint-based mining for pattern discovery. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA 2010, Part II. LNCS, vol. 6017, pp. 432\u2013447. Springer, Heidelberg (2010)"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Metivier, J.P., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., Loudni, S.: A constraint-based Language for Declarative Pattern Discovery. In: 2011 IEEE 11th International Conference on Data Mining Workshops (ICDMW), Vancouver, Canada, pp. 1112\u20131119 (2011)","DOI":"10.1109\/ICDMW.2011.11"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: ACM SIGKDD, pp. 204\u2013212 (2008)","DOI":"10.1145\/1401890.1401919"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-74970-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"J Marques-Silva","year":"2007","unstructured":"Marques-Silva, J., Lynce, I.: Towards robust cnf encodings of cardinality constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 483\u2013497. Springer, Heidelberg (2007)"},{"key":"52_CR12","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: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of derivations in the propositional calculus. In: Structures in Constructives Mathematics and Mathematical Logic, Part II, pp. 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"52_CR14","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters (1996)"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: KDD 04: Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 344\u2013353. ACM Press (2004)","DOI":"10.1145\/1014052.1014091"}],"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-18032-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T21:15:58Z","timestamp":1748380558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18032-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180311","9783319180328"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18032-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}