{"id":"https://openalex.org/W2080669612","doi":"https://doi.org/10.1145/1363686.1363724","title":"An efficient algorithm for a sharp approximation of universally quantified inequalities","display_name":"An efficient algorithm for a sharp approximation of universally quantified inequalities","publication_year":2008,"publication_date":"2008-03-16","ids":{"openalex":"https://openalex.org/W2080669612","doi":"https://doi.org/10.1145/1363686.1363724","mag":"2080669612"},"language":"en","primary_location":{"id":"doi:10.1145/1363686.1363724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0807.2269","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060692753","display_name":"Alexandre Goldsztejn","orcid":"https://orcid.org/0000-0002-6561-5888"},"institutions":[{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"A. Goldsztejn","raw_affiliation_strings":["University of Nantes, France"],"affiliations":[{"raw_affiliation_string":"University of Nantes, France","institution_ids":["https://openalex.org/I97188460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112856749","display_name":"C. Michel","orcid":null},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C. Michel","raw_affiliation_strings":["University of Nice, France","[UNIVERSITY OF NICE, FRANCE]"],"affiliations":[{"raw_affiliation_string":"University of Nice, France","institution_ids":["https://openalex.org/I201841394"]},{"raw_affiliation_string":"[UNIVERSITY OF NICE, FRANCE]","institution_ids":["https://openalex.org/I201841394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111943507","display_name":"Michel Rueher","orcid":null},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Rueher","raw_affiliation_strings":["University of Nice, France","[UNIVERSITY OF NICE, FRANCE]"],"affiliations":[{"raw_affiliation_string":"University of Nice, France","institution_ids":["https://openalex.org/I201841394"]},{"raw_affiliation_string":"[UNIVERSITY OF NICE, FRANCE]","institution_ids":["https://openalex.org/I201841394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060692753"],"corresponding_institution_ids":["https://openalex.org/I97188460"],"apc_list":null,"apc_paid":null,"fwci":0.3852,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68578748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"134","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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.9994000196456909,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9887999892234802,"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/algorithm","display_name":"Algorithm","score":0.6348681449890137},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6086210608482361},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6056011319160461},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5417317748069763},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5403497815132141},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.538937509059906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5007727146148682},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.49619466066360474},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4465467929840088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38339555263519287},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3755693733692169},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1828196942806244}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6348681449890137},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6086210608482361},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6056011319160461},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5417317748069763},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5403497815132141},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.538937509059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5007727146148682},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.49619466066360474},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4465467929840088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38339555263519287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3755693733692169},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1828196942806244},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1363686.1363724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:0807.2269","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0807.2269","pdf_url":"https://arxiv.org/pdf/0807.2269","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0807.2269","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0807.2269","pdf_url":"https://arxiv.org/pdf/0807.2269","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W53809769","https://openalex.org/W119888408","https://openalex.org/W1483874187","https://openalex.org/W1492347967","https://openalex.org/W1504204411","https://openalex.org/W1530296569","https://openalex.org/W1548650523","https://openalex.org/W1557280638","https://openalex.org/W1563516866","https://openalex.org/W1564221946","https://openalex.org/W1595068075","https://openalex.org/W1598511880","https://openalex.org/W1972645441","https://openalex.org/W1988549558","https://openalex.org/W1990426442","https://openalex.org/W2026742779","https://openalex.org/W2029381483","https://openalex.org/W2061749308","https://openalex.org/W2092007705","https://openalex.org/W2113342453","https://openalex.org/W2115344771","https://openalex.org/W2130550049","https://openalex.org/W2135202456","https://openalex.org/W2135432705","https://openalex.org/W2161706840","https://openalex.org/W2169004268","https://openalex.org/W4244919805","https://openalex.org/W6628933813","https://openalex.org/W6633007324","https://openalex.org/W6633527542","https://openalex.org/W6633808643","https://openalex.org/W6635780894","https://openalex.org/W6680064427"],"related_works":["https://openalex.org/W2373300491","https://openalex.org/W2395294869","https://openalex.org/W2378744544","https://openalex.org/W2594301978","https://openalex.org/W2379704676","https://openalex.org/W1998810860","https://openalex.org/W4206442282","https://openalex.org/W2384505857","https://openalex.org/W2355171581","https://openalex.org/W2023722467"],"abstract_inverted_index":{"This":[0,26],"paper":[1],"introduces":[2],"a":[3,8,40],"new":[4,41],"algorithm":[5,46,82],"for":[6,47,61,70],"solving":[7,48],"subclass":[9],"of":[10,28,74,86],"quantified":[11,21,63],"constraint":[12],"satisfaction":[13],"problems":[14],"(QCSP)":[15],"where":[16],"existential":[17],"quantifiers":[18],"precede":[19],"universally":[20,62],"inequalities":[22],"on":[23],"continuous":[24,50],"domains.":[25],"class":[27],"QCSPs":[29],"has":[30],"numerous":[31],"applications":[32],"in":[33],"engineering":[34],"and":[35,44,55],"design.":[36],"We":[37],"propose":[38],"here":[39],"generic":[42],"branch":[43],"prune":[45],"such":[49],"QCSPs.":[51],"Standard":[52],"pruning":[53],"operators":[54,58],"solution":[56],"identification":[57],"are":[59,67],"specialized":[60],"inequalities.":[64],"Special":[65],"rules":[66],"also":[68],"proposed":[69],"handling":[71],"the":[72,75,84,87],"parameters":[73],"constraints.":[76],"First":[77],"experimentation":[78],"show":[79],"that":[80],"our":[81],"outperforms":[83],"state":[85],"art":[88],"methods.":[89]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}