{"id":"https://openalex.org/W2741852089","doi":"https://doi.org/10.24963/ijcai.2017/175","title":"Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction","display_name":"Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2741852089","doi":"https://doi.org/10.24963/ijcai.2017/175","mag":"2741852089"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/175","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/175","pdf_url":"https://www.ijcai.org/proceedings/2017/0175.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0175.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087883689","display_name":"Michael Sioutis","orcid":"https://orcid.org/0000-0001-7562-2443"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I44563897","display_name":"Universit\u00e9 d'Artois","ror":"https://ror.org/053x9s498","country_code":"FR","type":"education","lineage":["https://openalex.org/I44563897"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michael Sioutis","raw_affiliation_strings":["Universit\u00e9 d'Artois, CRIL-CNRS UMR 8188, Lens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 d'Artois, CRIL-CNRS UMR 8188, Lens, France","institution_ids":["https://openalex.org/I44563897","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060067293","display_name":"Jean-Fran\u00e7ois Condotta","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I44563897","display_name":"Universit\u00e9 d'Artois","ror":"https://ror.org/053x9s498","country_code":"FR","type":"education","lineage":["https://openalex.org/I44563897"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Fran\u00e7ois Condotta","raw_affiliation_strings":["Universit\u00e9 d'Artois, CRIL-CNRS UMR 8188, Lens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 d'Artois, CRIL-CNRS UMR 8188, Lens, France","institution_ids":["https://openalex.org/I44563897","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2103,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56625966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1262","last_page":"1268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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.9932000041007996,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9927999973297119,"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/local-consistency","display_name":"Local consistency","score":0.7662529945373535},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7069200277328491},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6879799365997314},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6637042760848999},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6117763519287109},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5277783870697021},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.523722231388092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5017099380493164},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.42500898241996765},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41103169322013855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3607775568962097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3440236449241638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32157132029533386},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1425309181213379},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13050955533981323}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.7662529945373535},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7069200277328491},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6879799365997314},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6637042760848999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6117763519287109},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5277783870697021},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.523722231388092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5017099380493164},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.42500898241996765},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41103169322013855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3607775568962097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3440236449241638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32157132029533386},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1425309181213379},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13050955533981323},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2017/175","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/175","pdf_url":"https://www.ijcai.org/proceedings/2017/0175.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02067933v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02067933","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":"Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.1262-1268, ⟨10.24963/ijcai.2017/175⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/175","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/175","pdf_url":"https://www.ijcai.org/proceedings/2017/0175.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2741852089.pdf","grobid_xml":"https://content.openalex.org/works/W2741852089.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W133060186","https://openalex.org/W1489545972","https://openalex.org/W1528419757","https://openalex.org/W1597095978","https://openalex.org/W1658695185","https://openalex.org/W1800693550","https://openalex.org/W1958661713","https://openalex.org/W1981856605","https://openalex.org/W1982175848","https://openalex.org/W1991477862","https://openalex.org/W1993695231","https://openalex.org/W2008620264","https://openalex.org/W2018756677","https://openalex.org/W2061100549","https://openalex.org/W2072965014","https://openalex.org/W2084875723","https://openalex.org/W2088460125","https://openalex.org/W2116537119","https://openalex.org/W2122829242","https://openalex.org/W2161484642","https://openalex.org/W2201305657","https://openalex.org/W2275342776","https://openalex.org/W2295731100","https://openalex.org/W2349759657","https://openalex.org/W2406344851","https://openalex.org/W2530792914","https://openalex.org/W2572204051","https://openalex.org/W3012525065"],"related_works":["https://openalex.org/W2118249115","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2141935412","https://openalex.org/W2784687883","https://openalex.org/W96881443","https://openalex.org/W2216566009","https://openalex.org/W2140769824","https://openalex.org/W2139423517","https://openalex.org/W4303044088"],"abstract_inverted_index":{"Partial":[0],"closure":[1],"under":[2],"weak":[3,7,58,79,138],"composition,":[4],"or":[5],"partial":[6,57,78,137],"path-consistency":[8,59],"for":[9,13,54,70,110,135],"short,":[10],"is":[11,32,92,108],"essential":[12],"tackling":[14],"fundamental":[15],"reasoning":[16],"problems":[17],"associated":[18],"with":[19,120],"qualitative":[20,61,71,112,121],"constraint":[21,62,72,113,122],"networks,":[22,63,73],"such":[23],"as":[24,40,42,96],"the":[25,66,82,103,125,141],"satisfiability":[26],"checking":[27],"problem,":[28],"and":[29,143],"therefore":[30],"it":[31,39],"crucial":[33],"to":[34,37,88,98],"be":[35],"able":[36],"enforce":[38],"fast":[41],"possible.":[43],"To":[44],"this":[45],"end,":[46],"we":[47,118],"propose":[48],"a":[49,99,130],"new":[50],"algorithm,":[51],"called":[52],"PWC\u03b1,":[53],"efficiently":[55],"enforcing":[56,136],"on":[60],"that":[64,117],"exploits":[65],"notion":[67],"of":[68,77,84,124,145],"abstraction":[69],"utilizes":[74],"certain":[75],"properties":[76],"path-consistency,and":[80],"adapts":[81],"functionalities":[83],"some":[85],"state-of-the-art":[86,132],"algorithms":[87],"its":[89],"design.":[90],"It":[91],"worth":[93],"noting":[94],"that,":[95],"opposed":[97],"related":[100],"approach":[101],"in":[102],"recent":[104],"literature,":[105],"algorithm":[106,134,146],"PWC\u03b1":[107],"complete":[109],"arbitrary":[111],"networks.":[114],"The":[115],"evaluation":[116],"conducted":[119],"networks":[123],"Region":[126],"Connection":[127],"Calculus":[128],"against":[129],"competing":[131],"generic":[133],"path-consistency,":[139],"demonstrates":[140],"usefulness":[142],"efficiency":[144],"PWC\u03b1.":[147]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}