{"id":"https://openalex.org/W2731943086","doi":"https://doi.org/10.1007/978-3-319-50137-6_4","title":"ModelSeeker: Extracting Global Constraint Models from Positive Examples","display_name":"ModelSeeker: Extracting Global Constraint Models from Positive Examples","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2731943086","doi":"https://doi.org/10.1007/978-3-319-50137-6_4","mag":"2731943086"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-50137-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-50137-6_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060817116","display_name":"Nicolas Beldiceanu","orcid":"https://orcid.org/0000-0003-1452-596X"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Beldiceanu","raw_affiliation_strings":["TASC Team (INRIA/CNRS), Mines Nantes, 44307, Nantes, France"],"affiliations":[{"raw_affiliation_string":"TASC Team (INRIA/CNRS), Mines Nantes, 44307, Nantes, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039254305","display_name":"Helmut Simonis","orcid":"https://orcid.org/0009-0003-6117-2463"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Helmut Simonis","raw_affiliation_strings":["Insight Centre for Data Analytics, Department of Computer Science, University College Cork, Cork, Ireland"],"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, Department of Computer Science, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039254305"],"corresponding_institution_ids":["https://openalex.org/I27577105"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.31392902,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8169313669204712},{"id":"https://openalex.org/keywords/laptop","display_name":"Laptop","score":0.6432067155838013},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6117032170295715},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6052607297897339},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5670466423034668},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.5571460723876953},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5081732273101807},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4646012485027313},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44635212421417236},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43206435441970825},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42917025089263916},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3969342112541199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3378978967666626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31126677989959717},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27757567167282104},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2042907476425171},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10139814019203186},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07199651002883911}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8169313669204712},{"id":"https://openalex.org/C2780008327","wikidata":"https://www.wikidata.org/wiki/Q3962","display_name":"Laptop","level":2,"score":0.6432067155838013},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6117032170295715},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6052607297897339},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5670466423034668},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.5571460723876953},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5081732273101807},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4646012485027313},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44635212421417236},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43206435441970825},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42917025089263916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3969342112541199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3378978967666626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31126677989959717},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27757567167282104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2042907476425171},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10139814019203186},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07199651002883911},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-50137-6_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-50137-6_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01436062v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01436062","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Christian Bessiere; Luc De Raedt; Lars Kotthoff; Siegfried Nijssen; Barry O'Sullivan; Dino Pedreschi. Data Mining and Constraint Programming, 10101, Springer, pp.77-95, 2016, Data Mining and Constraint Programming, 978-3-319-50136-9. ⟨10.1007/978-3-319-50137-6_4⟩","raw_type":"Book sections"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W10942467","https://openalex.org/W15946853","https://openalex.org/W141304919","https://openalex.org/W303670457","https://openalex.org/W855425110","https://openalex.org/W1510761797","https://openalex.org/W1516905216","https://openalex.org/W1523751874","https://openalex.org/W1533046786","https://openalex.org/W1589158051","https://openalex.org/W1775522515","https://openalex.org/W1776181708","https://openalex.org/W1982007983","https://openalex.org/W2000059300","https://openalex.org/W2023772817","https://openalex.org/W2024144573","https://openalex.org/W2038997204","https://openalex.org/W2059310502","https://openalex.org/W2130272456","https://openalex.org/W2156172772","https://openalex.org/W2166264273","https://openalex.org/W2320377306","https://openalex.org/W2761798304","https://openalex.org/W2917125947","https://openalex.org/W4206586122","https://openalex.org/W4247191984","https://openalex.org/W4293662999","https://openalex.org/W4312092243"],"related_works":["https://openalex.org/W2806071588","https://openalex.org/W2097415053","https://openalex.org/W1514298554","https://openalex.org/W1486916474","https://openalex.org/W4243324743","https://openalex.org/W1531664660","https://openalex.org/W2120647900","https://openalex.org/W1496100162","https://openalex.org/W4303044088","https://openalex.org/W4313469555"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}