{"id":"https://openalex.org/W2066911265","doi":"https://doi.org/10.1145/1389449.1389478","title":"Global difference constraint propagation for finite domain solvers","display_name":"Global difference constraint propagation for finite domain solvers","publication_year":2008,"publication_date":"2008-07-15","ids":{"openalex":"https://openalex.org/W2066911265","doi":"https://doi.org/10.1145/1389449.1389478","mag":"2066911265"},"language":"en","primary_location":{"id":"doi:10.1145/1389449.1389478","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},"type":"article","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/A5060406733","display_name":"Thibaut Feydy","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Thibaut Feydy","raw_affiliation_strings":["The University of Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070536977","display_name":"Andreas Schutt","orcid":"https://orcid.org/0000-0001-5452-4086"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Andreas Schutt","raw_affiliation_strings":["The University of Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064839018","display_name":"Peter J. Stuckey","orcid":"https://orcid.org/0000-0003-2186-0459"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Peter J. Stuckey","raw_affiliation_strings":["The University of Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":1.5256,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84682976,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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.9927999973297119,"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.9842000007629395,"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/propagator","display_name":"Propagator","score":0.8663812875747681},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5886132121086121},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.572884738445282},{"id":"https://openalex.org/keywords/finite-difference","display_name":"Finite difference","score":0.5391350984573364},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5203692317008972},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5163429975509644},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4588108956813812},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.45240551233291626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4402090907096863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4293132424354553},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40833067893981934},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3846895396709442},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20023113489151},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13471907377243042},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.08919617533683777}],"concepts":[{"id":"https://openalex.org/C104416048","wikidata":"https://www.wikidata.org/wiki/Q302518","display_name":"Propagator","level":2,"score":0.8663812875747681},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5886132121086121},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.572884738445282},{"id":"https://openalex.org/C181330731","wikidata":"https://www.wikidata.org/wiki/Q2068418","display_name":"Finite difference","level":2,"score":0.5391350984573364},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5203692317008972},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5163429975509644},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4588108956813812},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.45240551233291626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4402090907096863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4293132424354553},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40833067893981934},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3846895396709442},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20023113489151},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13471907377243042},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.08919617533683777},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1389449.1389478","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.7111","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mu.oz.au/~pjs/papers/ppdp2008b.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W198923957","https://openalex.org/W1488662850","https://openalex.org/W1518101386","https://openalex.org/W1535839566","https://openalex.org/W1604659092","https://openalex.org/W1863489072","https://openalex.org/W1949482742","https://openalex.org/W1986964870","https://openalex.org/W2022846948","https://openalex.org/W2035305340","https://openalex.org/W2078003433","https://openalex.org/W2090286414","https://openalex.org/W2096399907","https://openalex.org/W2111979987","https://openalex.org/W2130182605","https://openalex.org/W6640961642"],"related_works":["https://openalex.org/W2747757380","https://openalex.org/W4249951934","https://openalex.org/W2336717475","https://openalex.org/W3028230607","https://openalex.org/W2019645717","https://openalex.org/W2016113450","https://openalex.org/W1998269422","https://openalex.org/W2024607757","https://openalex.org/W2052499411","https://openalex.org/W2385642964"],"abstract_inverted_index":{"Difference":[0],"constraints":[1,75,91,101,129],"of":[2,21,36,53,105],"the":[3,103,114,117,135],"form":[4],"x":[5],"-":[6],"y":[7],"\u2264":[8],"d":[9],"are":[10,119],"well":[11],"studied,":[12],"with":[13],"efficient":[14],"algorithms":[15,30],"for":[16,73,89,92,99],"satisfaction":[17],"and":[18,39],"implication,":[19],"because":[20],"their":[22],"connection":[23],"to":[24,66],"shortest":[25],"paths.":[26],"Finite":[27],"domain":[28],"propagation":[29,137],"however":[31],"do":[32],"not":[33],"make":[34],"use":[35],"these":[37],"algorithms,":[38],"typically":[40],"treat":[41],"each":[42],"difference":[43,74,90,100,108,128],"constraint":[44,109],"as":[45],"a":[46,68,96,106],"separate":[47],"propagator.":[48],"Propagation":[49],"does":[50],"guarantee":[51],"completeness":[52],"solving":[54],"but":[55],"can":[56,131],"be":[57],"needlessly":[58],"slow.":[59],"In":[60],"this":[61],"paper":[62],"we":[63,111],"describe":[64],"how":[65,113],"build":[67],"(bounds":[69],"consistent)":[70],"global":[71,107],"propagator":[72,118],"that":[76,126],"treats":[77],"them":[78],"all":[79],"simultaneously.":[80],"SAT":[81],"modulo":[82],"theory":[83,87,97],"solvers":[84,88],"have":[85],"included":[86],"some":[93],"time.":[94],"While":[95],"solver":[98],"gives":[102],"basis":[104],"propagator,":[110],"show":[112],"requirements":[115],"on":[116,134],"quite":[120],"different.":[121],"We":[122],"give":[123],"experiments":[124],"showing":[125],"treating":[127],"globally":[130],"substantially":[132],"improve":[133],"standard":[136],"approach":[138]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}
