{"id":"https://openalex.org/W4366452016","doi":"https://doi.org/10.1007/978-3-031-30820-8_13","title":"CoPTIC: Constraint Programming Translated Into C","display_name":"CoPTIC: Constraint Programming Translated Into C","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4366452016","doi":"https://doi.org/10.1007/978-3-031-30820-8_13"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-30820-8_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30820-8_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30820-8_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30820-8_13.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018150695","display_name":"Martin Mariusz Lester","orcid":"https://orcid.org/0000-0002-2323-1771"},"institutions":[{"id":"https://openalex.org/I71052956","display_name":"University of Reading","ror":"https://ror.org/05v62cm79","country_code":"GB","type":"education","lineage":["https://openalex.org/I71052956"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Mariusz Lester","raw_affiliation_strings":["University of Reading, Reading, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-2323-1771","affiliations":[{"raw_affiliation_string":"University of Reading, Reading, United Kingdom","institution_ids":["https://openalex.org/I71052956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018150695"],"corresponding_institution_ids":["https://openalex.org/I71052956"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.9134,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74085012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"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.9987000226974487,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8278802037239075},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.8045596480369568},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7343286871910095},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6303080916404724},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6270671486854553},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5920710563659668},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.5538755059242249},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5321468710899353},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.47808218002319336},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4555342197418213},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4479215443134308},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4261277914047241},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.283651739358902},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23797830939292908},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08939051628112793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08599695563316345}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8278802037239075},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.8045596480369568},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7343286871910095},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6303080916404724},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6270671486854553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5920710563659668},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.5538755059242249},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5321468710899353},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.47808218002319336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4555342197418213},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4479215443134308},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4261277914047241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.283651739358902},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23797830939292908},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08939051628112793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08599695563316345},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-30820-8_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30820-8_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30820-8_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:centaur.reading.ac.uk:110428","is_oa":false,"landing_page_url":"https://centaur.reading.ac.uk/110428/1/paper-camera-ready.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402273","display_name":"CentAUR (University of Reading)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I71052956","host_organization_name":"University of Reading","host_organization_lineage":["https://openalex.org/I71052956"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-30820-8_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30820-8_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30820-8_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4366452016.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W4568814","https://openalex.org/W121297392","https://openalex.org/W1518705996","https://openalex.org/W1592492435","https://openalex.org/W1946570941","https://openalex.org/W2023331514","https://openalex.org/W2129538349","https://openalex.org/W2150824430","https://openalex.org/W2159875930","https://openalex.org/W2400555644","https://openalex.org/W2406720120","https://openalex.org/W2750143525","https://openalex.org/W2805419234","https://openalex.org/W2949558051","https://openalex.org/W3002945688","https://openalex.org/W3004630888","https://openalex.org/W3083663179","https://openalex.org/W4294790340","https://openalex.org/W6632728906","https://openalex.org/W6700912272","https://openalex.org/W6931595087"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W4303044088","https://openalex.org/W2500041535","https://openalex.org/W1563755460","https://openalex.org/W1971069708","https://openalex.org/W2032348095","https://openalex.org/W2520084020","https://openalex.org/W1820477541"],"abstract_inverted_index":{"Abstract":[0],"Constraint":[1],"programming":[2,25,45,58],"systems":[3,16],"allow":[4],"a":[5,22,29,53,63,69,107,127,131,158,179],"diverse":[6],"range":[7],"of":[8,154],"problems":[9],"to":[10,20,31,51,66,90,102,167,177,182],"be":[11,168],"modelled":[12],"and":[13,33,147],"solved.":[14],"Most":[15],"require":[17],"the":[18,42,49,56,92,97,104,114,165,171,184],"user":[19,50],"learn":[21],"new":[23],"constraint":[24,44,133,145],"language,":[26],"which":[27,47,110],"presents":[28],"barrier":[30],"novice":[32],"casual":[34,141],"users.":[35,142],"To":[36],"address":[37],"this":[38,122,173],"problem,":[39],"we":[40],"present":[41],"CoPTIC":[43,95,143,163],"system,":[46],"allows":[48,164],"write":[52],"model":[54,74,99,105,166],"in":[55,186],"well-known":[57],"language":[59,134],"C,":[60],"augmented":[61],"with":[62,170],"simple":[64],"API":[65],"support":[67],"using":[68,113],"guess-and-check":[70],"paradigm.":[71],"The":[72],"resulting":[73],"is":[75,111,123],"at":[76],"most":[77],"as":[78,80,150,152],"complex":[79],"an":[81],"ordinary":[82],"C":[83],"program":[84],"that":[85],"uses":[86,96],"naive":[87],"brute":[88],"force":[89],"solve":[91],"same":[93],"problem.":[94],"bounded":[98],"checker":[100],"CBMC":[101],"translate":[103],"into":[106,135],"SAT":[108,115],"instance,":[109],"solved":[112],"solver":[116],"CaDiCaL.":[117],"We":[118],"show":[119],"that,":[120],"while":[121],"less":[124],"efficient":[125],"than":[126],"direct":[128],"translation":[129],"from":[130],"dedicated":[132],"SAT,":[136],"performance":[137],"remains":[138],"adequate":[139],"for":[140],"supports":[144],"satisfaction":[146],"optimisation":[148],"problems,":[149],"well":[151],"enumeration":[153],"multiple":[155],"solutions.":[156],"After":[157],"solution":[159,185],"has":[160],"been":[161],"found,":[162],"run":[169],"solution;":[172],"makes":[174],"it":[175],"easy":[176],"debug":[178],"model,":[180],"or":[181],"print":[183],"any":[187],"desired":[188],"format.":[189]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2023-04-22T00:00:00"}