{"id":"https://openalex.org/W2305237467","doi":"https://doi.org/10.1051/ro/2015017","title":"Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints","display_name":"Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2305237467","doi":"https://doi.org/10.1051/ro/2015017","mag":"2305237467"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2015017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2015017","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro/2015017.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102981580","display_name":"Zineb Habbas","orcid":"https://orcid.org/0000-0002-9398-7072"},"institutions":[{"id":"https://openalex.org/I1288283403","display_name":"Georgia Tech-Europe","ror":"https://ror.org/02m5dy175","country_code":"FR","type":"education","lineage":["https://openalex.org/I1288283403"]},{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zineb Habbas","raw_affiliation_strings":["LCOMS EA 7306, University of Lorraine, Metz, France","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LCOMS EA 7306, University of Lorraine, Metz, France","institution_ids":["https://openalex.org/I1288283403","https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085942031","display_name":"Kamal Amroun","orcid":"https://orcid.org/0000-0002-4259-2783"},"institutions":[{"id":"https://openalex.org/I187560010","display_name":"University of B\u00e9ja\u00efa","ror":"https://ror.org/03yb2hp88","country_code":"DZ","type":"education","lineage":["https://openalex.org/I187560010"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Kamal Amroun","raw_affiliation_strings":["LIMED, Facult\u00e9 des Sciences Exactes, Universit\u00e9 de Bejaia, 06000 Bejaia, Algeria","LIMED - Laboratoire d'Informatique M\u00e9dicale (Universit\u00e9 Abderrahmane Mira de B\u00e9ja\u00efa, Laboratoire d'Informatique M\u00e9dicale (LIMED), 06000, B\u00e9ja\u00efa - Algeria)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMED, Facult\u00e9 des Sciences Exactes, Universit\u00e9 de Bejaia, 06000 Bejaia, Algeria","institution_ids":["https://openalex.org/I187560010"]},{"raw_affiliation_string":"LIMED - Laboratoire d'Informatique M\u00e9dicale (Universit\u00e9 Abderrahmane Mira de B\u00e9ja\u00efa, Laboratoire d'Informatique M\u00e9dicale (LIMED), 06000, B\u00e9ja\u00efa - Algeria)","institution_ids":["https://openalex.org/I187560010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073895931","display_name":"Daniel Singer","orcid":"https://orcid.org/0000-0001-5479-2806"},"institutions":[{"id":"https://openalex.org/I1288283403","display_name":"Georgia Tech-Europe","ror":"https://ror.org/02m5dy175","country_code":"FR","type":"education","lineage":["https://openalex.org/I1288283403"]},{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Daniel Singer","raw_affiliation_strings":["LCOMS EA 7306, University of Lorraine, Metz, France","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LCOMS EA 7306, University of Lorraine, Metz, France","institution_ids":["https://openalex.org/I1288283403","https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17799026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"50","issue":"2","first_page":"241","last_page":"267"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9896000027656555,"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/T10142","display_name":"Formal Methods in Verification","score":0.9642999768257141,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6956995129585266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6103366613388062},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.5766292810440063},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5621159076690674},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5586733818054199},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5536582469940186},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5160850882530212},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49505510926246643},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.44065237045288086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41704216599464417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32161813974380493},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07887831330299377}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6956995129585266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6103366613388062},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.5766292810440063},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5621159076690674},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5586733818054199},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5536582469940186},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5160850882530212},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49505510926246643},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.44065237045288086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41704216599464417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32161813974380493},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07887831330299377},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2015017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2015017","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2016__50_2_241_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015017/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015017.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"},{"id":"pmh:oai:HAL:hal-01277953v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01277953","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":"RAIRO - Operations Research, 2015, 50 (2), pp.241-267. ⟨10.1051/ro/2015017⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2016__50_2_241_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015017/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015017.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2305237467.pdf","grobid_xml":"https://content.openalex.org/works/W2305237467.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W5383638","https://openalex.org/W27267440","https://openalex.org/W118329590","https://openalex.org/W124379283","https://openalex.org/W1497452703","https://openalex.org/W1534902470","https://openalex.org/W1551739174","https://openalex.org/W1577788539","https://openalex.org/W1592840579","https://openalex.org/W1594077559","https://openalex.org/W1804601140","https://openalex.org/W1970074386","https://openalex.org/W1978282744","https://openalex.org/W1999038767","https://openalex.org/W2002478775","https://openalex.org/W2003516442","https://openalex.org/W2010489986","https://openalex.org/W2021989496","https://openalex.org/W2029448190","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2057256946","https://openalex.org/W2065023965","https://openalex.org/W2067754118","https://openalex.org/W2080192364","https://openalex.org/W2098268683","https://openalex.org/W2119456262","https://openalex.org/W2125336041","https://openalex.org/W2138319640","https://openalex.org/W2153629319","https://openalex.org/W2160106563","https://openalex.org/W2167634979","https://openalex.org/W2280659633","https://openalex.org/W2628596753","https://openalex.org/W2762210817","https://openalex.org/W2952861917","https://openalex.org/W4238753197"],"related_works":["https://openalex.org/W2951209234","https://openalex.org/W1787617900","https://openalex.org/W4297899896","https://openalex.org/W4313250736","https://openalex.org/W118329590","https://openalex.org/W2125895230","https://openalex.org/W1831144830","https://openalex.org/W3035604152","https://openalex.org/W2786706329","https://openalex.org/W2047916673"],"abstract_inverted_index":{"Many":[0],"real-world":[1],"problems":[2,88],"can":[3],"be":[4,25,71,130],"modelled":[5],"as":[6,32,140,142],"Constraint":[7],"Satisfaction":[8],"Problems":[9],"(CSPs).":[10],"Although":[11],"CSP":[12,22],"is":[13,78,154],"NP-complete,":[14],"it":[15],"has":[16,145],"been":[17,147],"proved":[18,155],"that":[19,164],"non":[20,187],"binary":[21,188],"instances":[23],"may":[24],"efficiently":[26],"solved":[27],"if":[28],"they":[29],"are":[30],"representable":[31],"Generalized":[33,192],"Hypertree":[34,193],"Decomposition":[35],"(GHD)":[36],"with":[37,55,117,190],"small":[38],"width.":[39],"Algorithms":[40],"for":[41,185],"solving":[42,186],"CSPs":[43,189],"based":[44],"on":[45,158],"a":[46,106,191],"GHD":[47],"consider":[48],"an":[49],"extensional":[50],"representation":[51,75,108],"of":[52,76,86,96,109,151,176],"constraints":[53,77],"together":[54],"join":[56],"and":[57,81,124,156,168],"semi-join":[58],"operations":[59,127,170],"giving":[60],"rise":[61],"to":[62,70,83,113,129],"new":[63,121],"large":[64],"constraint":[65,110],"tables":[66],"(or":[67],"relations)":[68],"needed":[69],"temporarily":[72],"saved.":[73],"Extensional":[74],"quite":[79],"natural":[80],"adapted":[82],"the":[84,93,173,177],"specification":[85],"real":[87],"but":[89],"unfortunately":[90],"limits":[91],"significantly":[92,172],"practical":[94,174],"performance":[95,175],"these":[97],"algorithms.":[98],"The":[99,149],"present":[100],"work":[101],"tackles":[102],"this":[103,118,152],"problem":[104],"using":[105,165],"compact":[107,119],"tables.":[111],"Consequently,":[112],"make":[114],"algorithms":[115],"compatible":[116],"representation,":[120],"\u201ccompressed":[122,125],"join\u201d":[123],"semi-join\u201d":[126],"have":[128],"defined.":[131],"This":[132],"last":[133],"step":[134],"constitutes":[135],"our":[136],"main":[137],"contribution":[138],"which,":[139],"far":[141],"we":[143],"know,":[144],"never":[146],"presented.":[148],"correctness":[150],"approach":[153],"validated":[157],"multiple":[159],"benchmarks.":[160],"Experimental":[161],"results":[162],"show":[163],"compressed":[166,169],"relations":[167],"improves":[171],"basic":[178],"algorithm":[179],"proposed":[180],"by":[181],"Gottlob":[182],"et":[183],"al.":[184],"Decomposition.":[194]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}