{"id":"https://openalex.org/W7117987935","doi":"https://doi.org/10.1007/978-3-032-13589-6_20","title":"Addressing Classic Constraint Satisfaction Problems Through Optimisation Modulo Theories","display_name":"Addressing Classic Constraint Satisfaction Problems Through Optimisation Modulo Theories","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7117987935","doi":"https://doi.org/10.1007/978-3-032-13589-6_20"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-13589-6_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-13589-6_20","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5121829922","display_name":"Ignacio Jorquera","orcid":null},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Ignacio Jorquera","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile"],"raw_orcid":"https://orcid.org/0009-0002-1219-9136","affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035606251","display_name":"Nicol\u00e1s G\u00e1lvez Ram\u00edrez","orcid":"https://orcid.org/0000-0002-8264-8534"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Nicol\u00e1s G\u00e1lvez Ram\u00edrez","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile"],"raw_orcid":"https://orcid.org/0000-0002-8264-8534","affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110660182","display_name":"Fr\u00e9d\u00e9ric Saubion","orcid":"https://orcid.org/0000-0001-8227-7174"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frederic Saubion","raw_affiliation_strings":["Universit\u00e9 Angers, Angers, France"],"raw_orcid":"https://orcid.org/0000-0001-8227-7174","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025002713","display_name":"Eric Monfroy","orcid":null},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Eric Monfroy","raw_affiliation_strings":["Universit\u00e9 Angers, Angers, France"],"raw_orcid":"https://orcid.org/0000-0001-7970-1368","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Angers, Angers, France","institution_ids":["https://openalex.org/I49451733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121804908","display_name":"Carlos Castro","orcid":null},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Carlos Castro","raw_affiliation_strings":["Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile"],"raw_orcid":"https://orcid.org/0000-0003-4149-7730","affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5121829922"],"corresponding_institution_ids":["https://openalex.org/I75778554"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03277173,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"267","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9222999811172485,"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.9222999811172485,"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/T10142","display_name":"Formal Methods in Verification","score":0.008999999612569809,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7067999839782715},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6395999789237976},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5514000058174133},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4968000054359436},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.48660001158714294},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.46470001339912415},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.45190000534057617},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.420199990272522},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.40959998965263367}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7067999839782715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6473000049591064},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6395999789237976},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5514000058174133},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4968000054359436},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.48660001158714294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46540001034736633},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4587000012397766},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.40959998965263367},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3970000147819519},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37560001015663147},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3598000109195709},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.353300005197525},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.33899998664855957},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.31459999084472656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2994000017642975},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C58013763","wikidata":"https://www.wikidata.org/wiki/Q5754574","display_name":"High-level synthesis","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-032-13589-6_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-13589-6_20","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-05630729v1","is_oa":false,"landing_page_url":"https://univ-angers.hal.science/hal-05630729","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":"8th International Conference, OLA 2025, Apr 2025, Dubai, United Arab Emirates. pp.267-278, ⟨10.1007/978-3-032-13589-6_20⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1484352250","https://openalex.org/W1504520037","https://openalex.org/W2015135969","https://openalex.org/W2118406528","https://openalex.org/W2170981423","https://openalex.org/W2922172735","https://openalex.org/W3081116997","https://openalex.org/W3083367323","https://openalex.org/W3193661502","https://openalex.org/W3207659231","https://openalex.org/W4239067298","https://openalex.org/W4389162055","https://openalex.org/W6892520114"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-02T00:00:00"}