{"id":"https://openalex.org/W7070610","doi":null,"title":"Optimal soft arc consistency","display_name":"Optimal soft arc consistency","publication_year":2007,"publication_date":"2007-01-06","ids":{"openalex":"https://openalex.org/W7070610","mag":"7070610"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-02754114v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.inrae.fr/hal-02754114","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th International Joint Conference on Artificial Intelligence - IJCAI 2007, Jan 2007, Hyderabad, India. pp.6","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.inrae.fr/hal-02754114","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004558530","display_name":"Martin Cooper","orcid":"https://orcid.org/0000-0003-4853-053X","observed_orcids":["https://orcid.org/0000-0003-4853-053X"]},"institutions":[{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cooper, Martin","raw_affiliation_strings":["Universit\u00e9 Toulouse III - Paul Sabatier"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Toulouse III - Paul Sabatier","institution_ids":["https://openalex.org/I134560555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065436134","display_name":"Simon de Givry","orcid":"https://orcid.org/0000-0002-2242-0458","observed_orcids":["https://orcid.org/0000-0002-2242-0458"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Givry, Simon","raw_affiliation_strings":["Unit\u00e9 de Biom\u00e9trie et Intelligence Artificielle (anc\u00eatre de MIAT)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Unit\u00e9 de Biom\u00e9trie et Intelligence Artificielle (anc\u00eatre de MIAT)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080878843","display_name":"Thomas Schiex","orcid":"https://orcid.org/0000-0001-6049-3415","observed_orcids":["https://orcid.org/0000-0001-6049-3415"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schiex, Thomas","raw_affiliation_strings":["Unit\u00e9 de Biom\u00e9trie et Intelligence Artificielle (anc\u00eatre de MIAT)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Unit\u00e9 de Biom\u00e9trie et Intelligence Artificielle (anc\u00eatre de MIAT)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2105,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.96701705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9916999936103821,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9916999936103821,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.006899999920278788,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.0003000000142492354,"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/valued-constraint-satisfaction-problems","display_name":"valued constraint satisfaction problems","score":0.875},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5960000157356262},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7879999876022339},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.6060000061988831},{"id":"https://openalex.org/keywords/constraint-optimization","display_name":"constraint optimization","score":0.3319999873638153}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7365812063217163},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6867566704750061},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5915603041648865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5802031755447388},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5413686037063599},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49944400787353516},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4946078956127167},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4664928913116455},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46033746004104614},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4592772126197815},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.4213395118713379},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42108145356178284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3297486901283264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29073047637939453},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08776593208312988},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07934790849685669},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:HAL:hal-02754114v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.inrae.fr/hal-02754114","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th International Joint Conference on Artificial Intelligence - IJCAI 2007, Jan 2007, Hyderabad, India. pp.6","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02754114v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.inrae.fr/hal-02754114","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th International Joint Conference on Artificial Intelligence - IJCAI 2007, Jan 2007, Hyderabad, India. pp.6","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W32927025","https://openalex.org/W46786713","https://openalex.org/W88635354","https://openalex.org/W103975088","https://openalex.org/W1485366229","https://openalex.org/W1506775176","https://openalex.org/W1528090900","https://openalex.org/W1558184472","https://openalex.org/W1568318479","https://openalex.org/W1625396064","https://openalex.org/W1969069392","https://openalex.org/W1969632617","https://openalex.org/W1976533903","https://openalex.org/W2044405428","https://openalex.org/W2074078071","https://openalex.org/W2084041193","https://openalex.org/W2089683553","https://openalex.org/W2090359754","https://openalex.org/W2135414191","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W1988443389","https://openalex.org/W132900507","https://openalex.org/W2084041193","https://openalex.org/W4415251314","https://openalex.org/W2044405428","https://openalex.org/W3112360738","https://openalex.org/W1694642836","https://openalex.org/W2100921442","https://openalex.org/W2810548642","https://openalex.org/W2595231452"],"abstract_inverted_index":{"The":[0,32],"Valued":[1],"(VCSP)":[2],"framework":[3,8],"is":[4,35,59,127],"a":[5,10,20,38,51,77,96],"generic":[6],"optimization":[7],"with":[9,76],"wide":[11],"range":[12],"of":[13,45,50,99,136,152],"applications.":[14],"Soft":[15],"arc":[16,101,133],"consistency":[17,102],"operations":[18],"transform":[19],"VCSP":[21],"into":[22],"an":[23,47,109,131],"equivalent":[24],"problem":[25],"by":[26],"shifting":[27],"weights":[28],"between":[29],"cost":[30,44],"functions.":[31],"principal":[33],"aim":[34],"to":[36,84,129],"produce":[37],"good":[39],"lower":[40,79,125,154],"bound":[41,54,80,126,155],"on":[42,142],"the":[43,74,123,137,150,153],"solutions,":[46],"essential":[48],"ingredient":[49],"branch":[52],"and":[53,72,91,144],"search.":[55],"But":[56],"soft":[57,100],"AC":[58],"much":[60],"more":[61],"complex":[62],"than":[63],"traditional":[64],"AC:":[65],"there":[66],"may":[67],"be":[68,85,113],"several":[69],"closures":[70],"(fixpoints)":[71],"finding":[73],"closure":[75,111],"maximum":[78],"has":[81],"been":[82],"shown":[83,128],"NP-hard":[86],"for":[87,119],"integer":[88],"costs":[89],"[Cooper":[90],"Schiex,":[92],"2004].":[93],"We":[94],"introduce":[95],"relaxed":[97],"variant":[98],"using":[103],"rational":[104,121],"costs.":[105],"In":[106],"this":[107],"case,":[108],"optimal":[110,132],"can":[112],"found":[114],"in":[115],"polynomial":[116],"time.":[117],"Furthermore,":[118],"finite":[120],"costs,":[122],"associated":[124],"provide":[130],"consistent":[134],"reformulation":[135],"initial":[138],"problem.":[139],"Preliminary":[140],"experiments":[141],"random":[143],"structured":[145],"problems":[146],"are":[147],"reported,":[148],"showing":[149],"strength":[151],"produced.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}