{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T20:57:54Z","timestamp":1769115474212,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_54","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"935-951","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Omissions in Constraint Acquisition"],"prefix":"10.1007","author":[{"given":"Dimosthenis C.","family":"Tsouros","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"issue":"4","key":"54_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988). https:\/\/doi.org\/10.1023\/A:1022821128753","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"54_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D Angluin","year":"1997","unstructured":"Angluin, D., Krikis, M., Sloan, R.H., Tur\u00e1n, G.: Malicious omissions and errors in answers to membership queries. Mach. Learn. 28(2\u20133), 211\u2013255 (1997)","journal-title":"Mach. Learn."},{"issue":"1","key":"54_CR3","first-page":"7","volume":"14","author":"D Angluin","year":"1994","unstructured":"Angluin, D., Slonim, D.K.: Randomly fallible teachers: learning monotone DNF with an incomplete membership oracle. Mach. Learn. 14(1), 7\u201326 (1994)","journal-title":"Mach. Learn."},{"key":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, pp. 141\u2013157. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_13"},{"key":"54_CR5","unstructured":"Bessiere, C., et al.: Constraint acquisition via partial queries. In: IJCAI, vol. 13, pp. 475\u2013481 (2013)"},{"key":"54_CR6","unstructured":"Bessiere, C., et al.: Query-driven constraint acquisition. In: IJCAI, vol. 7, pp. 50\u201355 (2007)"},{"key":"54_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-50137-6_3","volume-title":"Data Mining and Constraint Programming","author":"C Bessiere","year":"2016","unstructured":"Bessiere, C., et al.: New approaches to constraint acquisition. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 51\u201376. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6_3"},{"key":"54_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.: Constraint acquisition. Artif. Intell. 244, 315\u2013342 (2017)","journal-title":"Artif. Intell."},{"issue":"1","key":"54_CR9","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.: Learning with errors in answers to membership queries. J. Comput. Syst. Sci. 74(1), 2\u201315 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"54_CR10","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.: Exact learning from an honest teacher that answers membership queries. Theor. Comput. Sci. 733, 4\u201343 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"54_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N Bshouty","year":"1995","unstructured":"Bshouty, N.: Exact learning boolean functions via the monotone theory. Inf. Comput. 123(1), 146\u2013153 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"54_CR12","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.: Radio link frequency assignment. Constraints 4(1), 79\u201389 (1999). https:\/\/doi.org\/10.1023\/A:1009812409930","journal-title":"Constraints"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Frazier, M., Goldman, S., Mishra, N., Pitt, L.: Learning from a consistently ignorant teacher. In: Proceedings of the Seventh Annual Conference on Computational Learning Theory, pp. 328\u2013339. ACM (1994)","DOI":"10.1145\/180139.181170"},{"key":"54_CR14","unstructured":"Freuder, E.C.: Modeling: the final frontier. In: The First International Conference on the Practical Application of Constraint Technologies and Logic Programming (PACLP), London, pp. 15\u201321 (1999)"},{"issue":"2","key":"54_CR15","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.: Progress towards the holy grail. Constraints 23(2), 158\u2013171 (2018). https:\/\/doi.org\/10.1007\/s10601-017-9275-0","journal-title":"Constraints"},{"issue":"2","key":"54_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/2Fs10601-013-9155-1","volume":"19","author":"EC Freuder","year":"2014","unstructured":"Freuder, E.C., O\u2019Sullivan, B.: Grand challenges for constraint programming. Constraints 19(2), 150\u2013162 (2014). https:\/\/doi.org\/10.1007\/2Fs10601-013-9155-1","journal-title":"Constraints"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Goldman, S.A., Mathias, H.D.: Learning k-term DNF formulas with an incomplete membership oracle. In: COLT, pp. 77\u201384. Citeseer (1992)","DOI":"10.1145\/130385.130394"},{"key":"54_CR18","unstructured":"Mitchell, T.M.: Version spaces: an approach to concept learning. Technical report, Stanford Univ Calif Dept of Computer Science (1978)"},{"key":"54_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-030-30048-7_41","volume-title":"Principles and Practice of Constraint Programming","author":"DC Tsouros","year":"2019","unstructured":"Tsouros, D.C., Stergiou, K., Bessiere, C.: Structure-driven multiple constraint acquisition. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 709\u2013725. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_41"},{"key":"54_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-98334-9_25","volume-title":"Principles and Practice of Constraint Programming","author":"DC Tsouros","year":"2018","unstructured":"Tsouros, D.C., Stergiou, K., Sarigiannidis, P.G.: Efficient methods for constraint acquisition. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 373\u2013388. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_25"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:42:37Z","timestamp":1619242957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","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":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"0","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":"45% - 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.13","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":"3.47","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}