{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:17:32Z","timestamp":1782947852362,"version":"3.54.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032304933","type":"print"},{"value":"9783032304940","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-30494-0_9","type":"book-chapter","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:37:55Z","timestamp":1782945475000},"page":"129-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Satisfiability-Based Approach for\u00a0Mining Partially-Ordered Sequential Rules"],"prefix":"10.1007","author":[{"given":"Abdelhamid","family":"Boudane","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lamia","family":"Sadeg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Maiza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aoga, J.O.R., Guns, T., Schaus, P.: An efficient algorithm for mining frequent sequences with constraint programming. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2016), Lecture Notes in Computer Science, pp. 315\u2013330. Springer (2016)","DOI":"10.1007\/978-3-319-46227-1_20"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-Boolean constraints into cnf. In: Proceedings of the SAT, pp. 181\u2013194 (2009)","DOI":"10.1007\/978-3-642-02777-2_19"},{"key":"9_CR3","unstructured":"Boudane, A., Jabbour, S., Sais, L., Salhi, Y.: A sat-based approach for mining association rules. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2472\u20132478. IJCAI (2016)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boudane, A., Ouzghara, R.: Compact sat-based encoding of mining minimal non-redundant association rules. In: Proceedings of the 2024 IEEE 18th International Conference on Application of Information and Communication Technologies (AICT), pp. 1\u20136. IEEE (2024)","DOI":"10.1109\/AICT61888.2024.10740452"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Fournier-Viger, P., Nouioua, F., Wu, Y.: Sequence prediction using partially-ordered episode rules. In: Proceedings of the IEEE ICDM Workshops, pp. 574\u2013580. IEEE (2021)","DOI":"10.1109\/ICDMW53433.2021.00076"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1008335.1008338","volume":"8","author":"SA Cook","year":"1976","unstructured":"Cook, S.A.: A short proof of the pigeonhole principle using extended resolution. SIGACT News 8(4), 28\u201332 (1976)","journal-title":"SIGACT News"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 204\u2013212. ACM (2008)","DOI":"10.1145\/1401890.1401919"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ezeife, C.I., Karlapalepu, H.: A survey of sequential pattern-based e-commerce recommendation systems. Algorithms 16(10) (2023)","DOI":"10.3390\/a16100467"},{"key":"9_CR9","unstructured":"Fournier-Viger, P., Faghihi, U., Nkambou, R., Nguifo, E.M..: CMRULES: an efficient algorithm for mining sequential rules common to several sequences. In: Guesgen, H.W., Murray, R.C. (eds.) Proceedings of the 23rd International Florida Artificial Intelligence Research Society Conference (FLAIRS), pp. 106\u2013111. AAAI Press (2010)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Faghihi, U., Nkambou, R., Nguifo,E.M.: CMRules: mining sequential rules common to several sequences. Knowl. Based Syst. 25(1), 63\u201376 (2012)","DOI":"10.1016\/j.knosys.2011.07.005"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-12571-8_10","volume-title":"Advances in Intelligent Data Analysis XIII","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gueniche, T., Zida, S., Tseng, V.S.: ERMiner: Sequential Rule Mining Using Equivalence Classes. In: Blockeel, H., van Leeuwen, M., Vinciotti, V. (eds.) IDA 2014. LNCS, vol. 8819, pp. 108\u2013119. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12571-8_10"},{"issue":"8","key":"9_CR12","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TKDE.2015.2405509","volume":"27","author":"P Fournier-Viger","year":"2015","unstructured":"Fournier-Viger, P., Cheng-Wei, W., Tseng, V.S., Cao, L., Nkambou, R.: Mining partially-ordered sequential rules common to multiple sequences. IEEE Trans. Knowl. Data Eng. 27(8), 2203\u20132216 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel sat solver. J. Satisfiability Boolean Model. Comput. 6(4), 245\u2013262 (2009)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Izza, Y., Jabbour, S., Raddaoui, B., Boudane, A..: On the enumeration of association rules: a decomposition-based approach. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1265\u20131271. IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/176"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Lonlac, J., Sais, L., Salhi, Y..: Extending modern sat solvers for model enumeration. In: Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI), pp. 803\u2013810. IEEE (2014)","DOI":"10.1109\/IRI.2014.7051971"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s00607-020-00803-y","volume":"102","author":"S Jabbour","year":"2020","unstructured":"Jabbour, S., Mhadhbi, N., Raddaoui, B., Sais, L.: Sat-based models for overlapping community detection in networks. Computing 102(5), 1275\u20131299 (2020)","journal-title":"Computing"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Lee, J.M., Hauskrecht, M.: Neural clinical event sequence prediction through personalized online adaptive learning. In: Tucker, A., et al., (eds.) Artificial Intelligence in Medicine, pp. 175\u2013186. Springer (2021)","DOI":"10.1007\/978-3-030-77211-6_20"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, pp. 827\u2013831 (2005)","DOI":"10.1007\/11564751_73"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivations in the propositional calculus. Stud. Math. Math. Logic, 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"issue":"1\u20132","key":"9_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1\u20132), 31\u201360 (2001)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30494-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:38:07Z","timestamp":1782945487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30494-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,2]]},"ISBN":["9783032304933","9783032304940"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30494-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,2]]},"assertion":[{"value":"2 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}