{"id":"https://openalex.org/W2399304291","doi":"https://doi.org/10.3233/978-1-61499-098-7-510","title":"A Path-Optimal GAC Algorithm for Table Constraints","display_name":"A Path-Optimal GAC Algorithm for Table Constraints","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2399304291","doi":"https://doi.org/10.3233/978-1-61499-098-7-510","mag":"2399304291"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-098-7-510","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-098-7-510","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00873051/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lecoutre Christophe","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lecoutre Christophe","raw_affiliation_strings":["CRIL - Centre de Recherche en Informatique de Lens (Facult\u00e9 Jean Perrin Rue Jean Souvraz - SP 18 - 62307 LENS CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRIL - Centre de Recherche en Informatique de Lens (Facult\u00e9 Jean Perrin Rue Jean Souvraz - SP 18 - 62307 LENS CEDEX - France)","institution_ids":["https://openalex.org/I4210115519"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Likitvivatanavong Chavalit","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Likitvivatanavong Chavalit","raw_affiliation_strings":["School of Computing (Singapore)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing (Singapore)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028568420","display_name":"Roland H. C. Yap","orcid":"https://orcid.org/0000-0002-1188-7474"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yap Roland H.C.","raw_affiliation_strings":["School of Computing (Singapore)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing (Singapore)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.406,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.98711189,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"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.9991999864578247,"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.9991999864578247,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/path","display_name":"Path (computing)","score":0.7290893793106079},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.6804018020629883},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5075770616531372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4979405403137207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32798707485198975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28777623176574707},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10157102346420288},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.03215909004211426}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7290893793106079},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.6804018020629883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5075770616531372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4979405403137207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32798707485198975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28777623176574707},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10157102346420288},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.03215909004211426}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/978-1-61499-098-7-510","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-098-7-510","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00873051v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00873051","pdf_url":"https://hal.science/hal-00873051/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th European Conference on Artificial Intelligence (ECAI'12), 2012, France. pp.510-515","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00873051v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00873051","pdf_url":"https://hal.science/hal-00873051/document","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th European Conference on Artificial Intelligence (ECAI'12), 2012, France. pp.510-515","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2399304291.pdf","grobid_xml":"https://content.openalex.org/works/W2399304291.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1507924438","https://openalex.org/W1528090900","https://openalex.org/W1577788539","https://openalex.org/W1586970573","https://openalex.org/W1592840579","https://openalex.org/W1994652641","https://openalex.org/W2003516442","https://openalex.org/W2010489986","https://openalex.org/W2039795558","https://openalex.org/W2067754118","https://openalex.org/W2091984336","https://openalex.org/W2099980081","https://openalex.org/W2142785340"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Filtering":[0],"by":[1],"Generalized":[2],"Arc":[3],"Consistency":[4],"(GAC)":[5],"is":[6,55,80,111,123],"a":[7,45,51,73],"fundamental":[8],"technique":[9],"in":[10,15],"Constraint":[11],"Programming.":[12],"Recent":[13],"advances":[14],"GAC":[16,75,85],"algorithms":[17,63],"for":[18,64],"extensional":[19],"constraints":[20],"rely":[21],"on":[22],"direct":[23],"manipulation":[24],"of":[25,53,94,102,120],"tables":[26,122],"during":[27,86,127],"search.":[28,87,128],"Simple":[29],"Tabular":[30],"Reduction":[31],"(STR),":[32],"which":[33],"systematically":[34],"removes":[35],"invalid":[36],"tuples":[37],"from":[38],"tables,":[39,95],"has":[40],"been":[41],"shown":[42],"to":[43,57,83],"be":[44,58],"simple":[46],"yet":[47],"efficient":[48],"approach.":[49],"STR2,":[50],"refinement":[52],"STR,":[54],"considered":[56],"among":[59],"the":[60,103,117,121],"best":[61],"filtering":[62],"positive":[65],"table":[66],"constraints.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"introduce":[72],"new":[74],"algorithm":[76],"called":[77],"STR3":[78,88,110],"that":[79,109],"specifically":[81],"designed":[82],"enforce":[84],"can":[89],"completely":[90],"avoid":[91],"unnecessary":[92],"traversal":[93],"making":[96],"it":[97],"optimal":[98],"along":[99],"any":[100],"path":[101],"search":[104],"tree.":[105],"Our":[106],"experiments":[107],"show":[108],"much":[112],"faster":[113],"than":[114],"STR2":[115],"when":[116],"average":[118],"size":[119],"not":[124],"reduced":[125],"drastically":[126]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}