{"id":"https://openalex.org/W1996426177","doi":"https://doi.org/10.1137/050635900","title":"Efficient Algorithms for Description Problems over Finite Totally Ordered Domains","display_name":"Efficient Algorithms for Description Problems over Finite Totally Ordered Domains","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1996426177","doi":"https://doi.org/10.1137/050635900","mag":"1996426177"},"language":"en","primary_location":{"id":"doi:10.1137/050635900","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050635900","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5078545459","display_name":"\u00c1ngel J. Gil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00c1ngel J. Gil","raw_affiliation_strings":["angel.gil@upf.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"angel.gil@upf.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074896214","display_name":"Miki Hermann","orcid":"https://orcid.org/0000-0003-2517-2127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miki Hermann","raw_affiliation_strings":["hermann@lix.polytechnique.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"hermann@lix.polytechnique.fr#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004258961","display_name":"Gernot Salzer","orcid":"https://orcid.org/0000-0002-8950-1551"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gernot Salzer","raw_affiliation_strings":["salzer@logic.at#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"salzer@logic.at#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105405287","display_name":"Bruno Zanuttini","orcid":"https://orcid.org/0000-0003-1639-7236"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bruno Zanuttini","raw_affiliation_strings":["zanutti@info.unicaen.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"zanutti@info.unicaen.fr#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7538,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.75325086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"3","first_page":"922","last_page":"945"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9969000220298767,"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.9969000220298767,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9873999953269958,"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/T11106","display_name":"Data Management and Algorithms","score":0.9818999767303467,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.7037429809570312},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5806939005851746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5353399515151978},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5194596648216248},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.5040546655654907},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4970877468585968},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4792311489582062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47348129749298096},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.47224968671798706},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4348500967025757},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41059979796409607},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3775046169757843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36146271228790283},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.17496135830879211},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08795014023780823}],"concepts":[{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.7037429809570312},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5806939005851746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5353399515151978},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5194596648216248},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.5040546655654907},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4970877468585968},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4792311489582062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47348129749298096},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.47224968671798706},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4348500967025757},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41059979796409607},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3775046169757843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36146271228790283},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.17496135830879211},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08795014023780823},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050635900","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050635900","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2066409630","display_name":"Constraint Acquisition aNd Automatic Reformulation","funder_award_id":"ANR-06-BLAN-0383","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1554559928","https://openalex.org/W1635257673","https://openalex.org/W1748315421","https://openalex.org/W1978050007","https://openalex.org/W2016639451","https://openalex.org/W2024768126","https://openalex.org/W2025319967","https://openalex.org/W2026745535","https://openalex.org/W2035493071","https://openalex.org/W2041042424","https://openalex.org/W2090326529","https://openalex.org/W2116407296","https://openalex.org/W2127845326","https://openalex.org/W2129023820","https://openalex.org/W2134850460","https://openalex.org/W2137137684","https://openalex.org/W2150339067","https://openalex.org/W2150553139","https://openalex.org/W2167695567","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W2382566571","https://openalex.org/W2349321798","https://openalex.org/W2366686860","https://openalex.org/W3036520466","https://openalex.org/W2350859087","https://openalex.org/W2387118502","https://openalex.org/W4233775131","https://openalex.org/W2391262724","https://openalex.org/W1895124089","https://openalex.org/W1774334694"],"abstract_inverted_index":{"Given":[0],"a":[1,7,18],"finite":[2,8],"set":[3,27],"of":[4,16,28,64,70,81,101],"vectors":[5,65],"over":[6],"totally":[9],"ordered":[10],"domain,":[11],"we":[12],"study":[13],"the":[14,26,31,37,47,68,79,91,99,113],"problem":[15],"computing":[17],"constraint":[19,33],"in":[20],"conjunctive":[21],"normal":[22],"form":[23],"such":[24],"that":[25],"solutions":[29],"for":[30,46,62],"produced":[32],"is":[34],"identical":[35],"to":[36,116],"original":[38],"set.":[39],"We":[40],"develop":[41],"an":[42],"efficient":[43],"polynomial-time":[44,53],"algorithm":[45],"general":[48],"case,":[49],"followed":[50],"by":[51,93],"specific":[52],"algorithms":[54],"producing":[55],"Horn,":[56,58],"dual":[57],"and":[59,73,83,95,108],"bijunctive":[60],"formulas":[61],"sets":[63],"closed":[66],"under":[67],"operations":[69],"conjunction,":[71],"disjunction,":[72],"median,":[74],"respectively.":[75],"Our":[76],"results":[77,100],"generalize":[78],"work":[80],"Dechter":[82],"Pearl":[84],"on":[85,105,112],"relational":[86],"data,":[87],"as":[88,90],"well":[89],"papers":[92],"H\u00e9brard":[94],"Zanuttini.":[96],"They":[97],"complement":[98],"H\u00e4hnle":[102],"et":[103,110],"al.":[104,111],"multivalued":[106],"logics":[107],"Jeavons":[109],"algebraic":[114],"approach":[115],"constraints.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}