{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:06:42Z","timestamp":1769857602765,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10601-020-09311-4","type":"journal-article","created":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:06:27Z","timestamp":1600351587000},"page":"180-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient multiple constraint acquisition"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3040-0959","authenticated-orcid":false,"given":"Dimosthenis C.","family":"Tsouros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"9311_CR1","doi-asserted-by":"crossref","unstructured":"Tsouros, D.C., Stergiou, K., & Sarigiannidis, P.G. (2018). Efficient methods for constraint acquisition. In 24th International Conference on Principles and Practice of Constraint Programming.","DOI":"10.1007\/978-3-319-98334-9_25"},{"key":"9311_CR2","unstructured":"Freuder, E.C. (1999). Modeling: the final frontier. In The First International Conference on The Practical Application of Constraint Technologies and Logic Programming (PACLP), London (pp. 15\u201321)."},{"key":"9311_CR3","doi-asserted-by":"crossref","unstructured":"O\u2019Sullivan, B. (2010). Automated modelling and solving in constraint programming.. In AAAI (pp. 1493\u20131497).","DOI":"10.1609\/aaai.v24i1.7530"},{"issue":"2","key":"9311_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s10601-013-9155-1","volume":"19","author":"EC Freuder","year":"2014","unstructured":"Freuder, E.C., & O\u2019Sullivan, B. (2014). Grand challenges for constraint programming. Constraints, 19(2), 150\u2013162.","journal-title":"Constraints"},{"key":"9311_CR5","doi-asserted-by":"crossref","unstructured":"Lombardi, M., & Milano, M. (2018). Boosting combinatorial problem modeling with machine learning. arXiv:1807.05517.","DOI":"10.24963\/ijcai.2018\/772"},{"key":"9311_CR6","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Passerini, A., & Teso, S. (2018). Learning constraints from examples. In Proceedings in Thirty-Second AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v32i1.12217"},{"issue":"2","key":"9311_CR7","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10601-017-9275-0","volume":"23","author":"EC Freuder","year":"2018","unstructured":"Freuder, E.C. (2018). Progress towards the holy grail. Constraints, 23(2), 158\u2013171.","journal-title":"Constraints"},{"key":"9311_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.artint.2015.08.001","volume":"244","author":"C Bessiere","year":"2017","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., & O\u2019Sullivan, B. (2017). Constraint acquisition. Artificial Intelligence, 244, 315\u2013342.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9311_CR9","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine learning, 2(4), 319\u2013342.","journal-title":"Machine learning"},{"key":"9311_CR10","unstructured":"Bessiere, C., Coletta, R., Hebrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C.-G., Walsh, T., & et al. (2013). Constraint acquisition via partial queries.. In IJCAI: International Joint Conference on Artificial Intelligence, (Vol. 13 pp. 475\u2013481)."},{"key":"9311_CR11","unstructured":"Arcangioli, R., Bessiere, C., & Lazaar, N. (2016). Multiple constraint aquisition. In IJCAI: International Joint Conference on Artificial Intelligence (pp. 698\u2013704)."},{"key":"9311_CR12","doi-asserted-by":"crossref","unstructured":"Paulin, M., Bessiere, C., & Sallantin, J. (2008). Automatic design of robot behaviors through constraint network acquisition IEEE. In 20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI\u201908, (Vol. 1 pp. 275\u2013282).","DOI":"10.1109\/ICTAI.2008.83"},{"key":"9311_CR13","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Coletta, R., Freuder, E.C., & O\u2019Sullivan, B. (2004). Leveraging the learning power of examples in automated constraint acquisition. In International Conference on Principles and Practice of Constraint Programming Springer (pp. 123\u2013137).","DOI":"10.1007\/978-3-540-30201-8_12"},{"key":"9311_CR14","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Coletta, R., Koriche, F., & O\u2019Sullivan, B. (2005). A sat-based version space algorithm for acquiring constraint satisfaction problems. In European Conference on Machine Learning Springer (pp. 23\u201334).","DOI":"10.1007\/11564096_8"},{"key":"9311_CR15","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., & Vrain, C. (2010). On learning constraint problems. In 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI) IEEE, (Vol. 1 pp. 45\u201352).","DOI":"10.1109\/ICTAI.2010.16"},{"key":"9311_CR16","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2012). A model seeker: Extracting global constraint models from positive examples. In International Conference on Principles and Practice of Constraint Programming Springer (pp. 141\u2013157).","DOI":"10.1007\/978-3-642-33558-7_13"},{"key":"9311_CR17","doi-asserted-by":"crossref","unstructured":"Freuder, E.C., & Wallace, R.J. (1998). Suggestion strategies for constraint-based matchmaker agents. In International Conference on Principles and Practice of Constraint Programming Springer (pp. 192\u2013204).","DOI":"10.1007\/3-540-49481-2_15"},{"key":"9311_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Connell, S., O\u2019Sullivan, B., & Freuder, E.C. (2004). A study of query generation strategies for interactive constraint acquisition. In Applications and Science in Soft Computing (pp. 225\u2013232): Springer.","DOI":"10.1007\/978-3-540-45240-9_31"},{"key":"9311_CR19","unstructured":"Bessiere, C., Coletta, R., O\u2019Sullivan, B., Paulin, M., & et al. (2007). Query-driven constraint acquisition.. In IJCAI: International Joint Conference on Artificial Intelligence, (Vol. 7 pp. 50\u201355)."},{"key":"9311_CR20","doi-asserted-by":"crossref","unstructured":"Shchekotykhin, K., & Friedrich, G. (2009). Argumentation based constraint acquisition. In Ninth IEEE International Conference on Data Mining, ICDM\u201909 IEEE (pp. 476\u2013482).","DOI":"10.1109\/ICDM.2009.62"},{"key":"9311_CR21","doi-asserted-by":"crossref","unstructured":"Addi, H.A., Bessiere, C., Ezzahir, R., & Lazaar, N. (2018). Time-bounded query generator for constraint acquisition. In International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research Springer (pp. 1\u201317).","DOI":"10.1007\/978-3-319-93031-2_1"},{"key":"9311_CR22","doi-asserted-by":"crossref","unstructured":"Addi, H.A., & Ezzahir, R. (2019). $$p_a$$-quacq: Algorithm for constraint acquisition system. In Smart Data and Computational Intelligence (pp. 249\u2013256): Springer International Publishing.","DOI":"10.1007\/978-3-030-11914-0_27"},{"key":"9311_CR23","unstructured":"Daoudi, A., Mechqrane, Y., Bessiere, C., Lazaar, N., & Bouyakhf, E.H. (2016). Constraint acquisition using recommendation queries. In IJCAI: International Joint Conference on Artificial Intelligence (pp. 720\u2013726)."},{"key":"9311_CR24","unstructured":"Bessiere, C., Coletta, R., Daoudi, A., Lazaar, N., Mechqrane, Y., & Bouyakhf, E.-H. (2014). Boosting constraint acquisition via generalization queries.. In ECAI (pp. 99\u2013104)."},{"issue":"1","key":"9311_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"NH Bshouty","year":"1995","unstructured":"Bshouty, N.H. (1995). Exact learning boolean functions via the monotone theory. Information and Computation, 123(1), 146\u2013153.","journal-title":"Information and Computation"},{"key":"9311_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2018.04.034","volume":"733","author":"NH Bshouty","year":"2018","unstructured":"Bshouty, N.H. (2018). Exact learning from an honest teacher that answers membership queries. Theoretical Computer Science, 733, 4\u201343.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9311_CR27","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/jcss.1996.0021","volume":"52","author":"NH Bshouty","year":"1996","unstructured":"Bshouty, N.H., Goldman, S.A., Hancock, T.R., & Matar, S. (1996). Asking questions to minimize errors. Journal of computer and system sciences, 52(2), 268\u2013286.","journal-title":"Journal of computer and system sciences"},{"issue":"2-3","key":"9311_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF00992675","volume":"9","author":"D Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of horn clauses. Machine Learning, 9(2-3), 147\u2013164.","journal-title":"Machine Learning"},{"issue":"3","key":"9311_CR29","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.1995.1075","volume":"51","author":"A Blum","year":"1995","unstructured":"Blum, A., & Rudich, S. (1995). Fast learning of k-term dnf formulas with queries. Journal of Computer and System Sciences, 51(3), 367\u2013373.","journal-title":"Journal of Computer and System Sciences"},{"key":"9311_CR30","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Daoudi, A., Hebrard, E., Katsirelos, G., Lazaar, N., Mechqrane, Y., Narodytska, N., Quimper, C.-G., & Walsh, T. (2016). New approaches to constraint acquisition. In Data mining and constraint programming (pp. 51\u201376): Springer.","DOI":"10.1007\/978-3-319-50137-6_3"},{"issue":"6","key":"9311_CR31","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1137\/S0097539799349948","volume":"30","author":"S Khanna","year":"2001","unstructured":"Khanna, S., Sudan, M., Trevisan, L., & Williamson, D.P. (2001). The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6), 1863\u20131920.","journal-title":"SIAM Journal on Computing"},{"key":"9311_CR32","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., & Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of the 16th European Conference on Artificial Intelligence IOS Press (pp. 146\u2013150)."},{"key":"9311_CR33","unstructured":"Mason, J. (1997). Purdey\u2019s general store Dell Magazine April."},{"issue":"1","key":"9311_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B Cabon","year":"1999","unstructured":"Cabon, B., De Givry, S., Lobjois, L., Schiex, T., & Warners, J.P. (1999). Radio link frequency assignment. Constraints, 4(1), 79\u201389.","journal-title":"Constraints"},{"issue":"1","key":"9311_CR35","first-page":"7","volume":"14","author":"D Angluin","year":"1994","unstructured":"Angluin, D., & Slonim, D.K. (1994). Randomly fallible teachers: Learning monotone dnf with an incomplete membership oracle. Machine Learning, 14(1), 7\u201326.","journal-title":"Machine Learning"},{"issue":"2-3","key":"9311_CR36","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D Angluin","year":"1997","unstructured":"Angluin, D., Kri\u0137is, M., Sloan, R.H., & Tur\u00e1n, G. (1997). Malicious omissions and errors in answers to membership queries. Machine Learning, 28(2-3), 211\u2013255.","journal-title":"Machine Learning"},{"issue":"1","key":"9311_CR37","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jcss.2007.04.010","volume":"74","author":"L Bisht","year":"2008","unstructured":"Bisht, L., Bshouty, N.H., & Khoury, L. (2008). Learning with errors in answers to membership queries. Journal of Computer and System Sciences, 74(1), 2\u201315.","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"9311_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0020-0190(91)90220-C","volume":"37","author":"Y Sakakibara","year":"1991","unstructured":"Sakakibara, Y. (1991). On learning from queries and counterexamples in the presence of noise. Information Processing Letters, 37(5), 279\u2013284.","journal-title":"Information Processing Letters"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09311-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-020-09311-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09311-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T23:06:13Z","timestamp":1668812773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-020-09311-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,17]]},"references-count":38,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["9311"],"URL":"https:\/\/doi.org\/10.1007\/s10601-020-09311-4","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,17]]},"assertion":[{"value":"17 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}