{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:27:26Z","timestamp":1777566446578,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332708","type":"print"},{"value":"9783031332715","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-33271-5_25","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"378-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Boolean-Arithmetic Equations: Acquisition and\u00a0Uses"],"prefix":"10.1007","author":[{"given":"R.","family":"Gindullin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Beldiceanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Cheukam","family":"Ngouonou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Douence","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. -G.","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"issue":"12","key":"25_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3208071","volume":"61","author":"R Alur","year":"2018","unstructured":"Alur, R., Singh, R., Fisman, D., Solar-Lezama, A.: Search-based program synthesis. Commun. ACM 61(12), 84\u201393 (2018). https:\/\/doi.org\/10.1145\/3208071","journal-title":"Commun. ACM"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TFUZZ.2003.809901","volume":"11","author":"WH Au","year":"2003","unstructured":"Au, W.H., Chan, K.C.: Mining fuzzy association rules in a bank-account database. IEEE Trans. Fuzzy Syst. 11(2), 238\u2013248 (2003)","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1007\/978-3-540-72393-6_139","volume-title":"Advances in Neural Networks \u2013 ISNN 2007","author":"MSH Aung","year":"2007","unstructured":"Aung, M.S.H., et al.: Comparing analytical decision support models through Boolean rule extraction: a case study of ovarian Tumour malignancy. In: Liu, D., Fei, S., Hou, Z., Zhang, H., Sun, C. (eds.) ISNN 2007. LNCS, vol. 4492, pp. 1177\u20131186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72393-6_139"},{"issue":"6","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1007\/s10115-021-01565-5","volume":"63","author":"M Barbareschi","year":"2021","unstructured":"Barbareschi, M., Barone, S., Mazzocca, N.: Advancing synthesis of decision tree-based multiple classifier systems: an approximate computing case study. Knowl. Inf. Syst. 63(6), 1577\u20131596 (2021). https:\/\/doi.org\/10.1007\/s10115-021-01565-5","journal-title":"Knowl. Inf. Syst."},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45349-0_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"N Beldiceanu","year":"2000","unstructured":"Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 52\u201366. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_6"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107\u2013122. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_11"},{"key":"25_CR7","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global Constraint Catalog, 2nd Edition (revision a). Technical report T2012\u201303, Swedish Institute of Computer Science (2012). http:\/\/ri.diva-portal.org\/smash\/get\/diva2:1043063\/FULLTEXT01.pdf"},{"key":"25_CR8","unstructured":"Beldiceanu, N., Cheukam-Ngouonou, J., Douence, R., Gindullin, R., Quimper, C.G.: Acquiring maps of interrelated conjectures on sharp bounds. In: 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-10428-7_15","volume-title":"Principles and Practice of Constraint Programming","author":"C Bessiere","year":"2014","unstructured":"Bessiere, C., et al.: The balance constraint family. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 174\u2013189. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_15"},{"key":"25_CR10","unstructured":"Blum, A.: Relevant examples and relevant features: thoughts from computational learning theory. In: AAAI Fall Symposium on Relevance, vol. 5, p. 1 (1994)"},{"issue":"1\u20132","key":"25_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum, A.L., Langley, P.: Selection of relevant features and examples in machine learning. Artif. Intell. 97(1\u20132), 245\u2013271 (1997)","journal-title":"Artif. Intell."},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Brence, J., Todorovski, L., D\u017eeroski, S.: Probabilistic grammars for equation discovery. Knowl.-Based Syst. 224 (2021). https:\/\/doi.org\/10.1016\/j.knosys.2021.107077","DOI":"10.1016\/j.knosys.2021.107077"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Forman, G., Kirshenbaum, E.: Extremely fast text feature extraction for classification and indexing. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 1221\u20131230 (2008)","DOI":"10.1145\/1458082.1458243"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Golia, P., Slivovsky, F., Roy, S., Meel, K.S.: Engineering an efficient Boolean functional synthesis engine. In: 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD), pp. 1\u20139. IEEE (2021)","DOI":"10.1109\/ICCAD51958.2021.9643583"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Guyon, I., Elisseeff, A.: An introduction to feature extraction. In: Guyon, I., Nikravesh, M., Gunn, S., Zadeh, L.A. (eds.) Feature Extraction. Studies in Fuzziness and Soft Computing, vol. 207, pp. 1\u201325. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-35488-8_1","DOI":"10.1007\/978-3-540-35488-8_1"},{"key":"25_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107327","volume":"107","author":"D Jakobovic","year":"2021","unstructured":"Jakobovic, D., Picek, S., Martins, M.S., Wagner, M.: Toward more efficient heuristic construction of Boolean functions. Appl. Soft Comput. 107, 107327 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"25_CR17","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1080\/00207543.2019.1581954","volume":"57","author":"S Jun","year":"2019","unstructured":"Jun, S., Lee, S., Chun, H.: Learning dispatching rules using random forest in flexible job shop scheduling problems. Int. J. Prod. Res. 57(10), 3290\u20133310 (2019)","journal-title":"Int. J. Prod. Res."},{"key":"25_CR18","unstructured":"Knuth, D.: Art of Computer Programming, Volume 4, Generating All Trees, pp. 461\u2013462. Addison-Wesley, Boston (2006)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Kosman, E., Kolchinsky, I., Schuster, A.: Mining logical arithmetic expressions from proper representations. In: Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), pp. 621\u2013629. SIAM (2022)","DOI":"10.1137\/1.9781611977172.70"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Lambert-Torres, G.: Application of rough sets in power system control center data mining. In: 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No. 02CH37309). vol. 1, pp. 627\u2013631. IEEE (2002)","DOI":"10.1109\/PESW.2002.985077"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10472-017-9559-5","volume":"81","author":"CE Larson","year":"2017","unstructured":"Larson, C.E., Van Cleemput, N.: Automated conjecturing iii. Ann. Math. Artif. Intell. 81(3), 315\u2013327 (2017)","journal-title":"Ann. Math. Artif. Intell."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Mereani, F., Howe, J.M.: Exact and approximate rule extraction from neural networks with Boolean features. In: Proceedings of the 11th International Joint Conference on Computational Intelligence, pp. 424\u2013433. SCITEPRESS (2019)","DOI":"10.5220\/0008362904240433"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.jcss.2004.04.002","volume":"69","author":"E Mossel","year":"2004","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.A.: Learning functions of k relevant variables. J. Comput. Syst. Sci. 69(3), 421\u2013434 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR24","unstructured":"Mutlu, E.C., Oghaz, T.A.: Review on graph feature learning and feature extraction techniques for link prediction. arXiv preprint arXiv:1901.03425 (2019)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0026700","volume-title":"Machine Learning: ECML-98","author":"EM Nguifo","year":"1998","unstructured":"Nguifo, E.M., Njiwoua, P.: Using lattice-based framework as a tool for feature extraction. In: N\u00e9dellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 304\u2013309. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026700"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 331\u2013345. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48085-3_24"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45578-7_13","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"G Pesant","year":"2001","unstructured":"Pesant, G.: A filtering algorithm for the stretch constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183\u2013195. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_13"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Schelldorfer, J., Wuthrich, M.V.: Nesting classical actuarial models into neural networks (2019). Available at SSRN 3320525","DOI":"10.2139\/ssrn.3320525"},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Todorovski, L.: Equation discovery. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 327\u2013330. Springer, Boston, MA (2011). https:\/\/doi.org\/10.1007\/978-0-387-30164-8_258","DOI":"10.1007\/978-0-387-30164-8_258"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Yang, H., Rudin, C., Seltzer, M.: Scalable Bayesian rule lists. In: International Conference on Machine Learning, pp. 3921\u20133930. PMLR (2017)","DOI":"10.32614\/CRAN.package.sbrl"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1007\/978-3-030-58475-7_55","volume-title":"Principles and Practice of Constraint Programming","author":"J Yu","year":"2020","unstructured":"Yu, J., Ignatiev, A., Stuckey, P.J., Le Bodic, P.: Computing optimal decision sets with SAT. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 952\u2013970. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_55"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T21:40:27Z","timestamp":1729460427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_25","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":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","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":"26","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":"6","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":"37% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}