{"id":"https://openalex.org/W2160238445","doi":"https://doi.org/10.1145/1066677.1066768","title":"On the computational limits of infinite satisfaction","display_name":"On the computational limits of infinite satisfaction","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W2160238445","doi":"https://doi.org/10.1145/1066677.1066768","mag":"2160238445"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066768","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-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/A5038346780","display_name":"Stefan Dantchev","orcid":"https://orcid.org/0000-0003-4534-2242"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Stefan Dantchev","raw_affiliation_strings":["Univ. of Durham"],"affiliations":[{"raw_affiliation_string":"Univ. of Durham","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107827722","display_name":"Frank Valencia","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frank D. Valencia","raw_affiliation_strings":["LIX \u00c9cole Polytechnique de Paris"],"affiliations":[{"raw_affiliation_string":"LIX \u00c9cole Polytechnique de Paris","institution_ids":["https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038346780"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23250229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"393","last_page":"397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973000288009644,"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.9973000288009644,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9639000296592712,"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/undecidable-problem","display_name":"Undecidable problem","score":0.9362764358520508},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8723522424697876},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7729227542877197},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.694610059261322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6054186224937439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5540515184402466},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5477317571640015},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5270227193832397},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.520620584487915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4409600794315338},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.43266257643699646},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43093156814575195},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41268616914749146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2621024549007416}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9362764358520508},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8723522424697876},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7729227542877197},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.694610059261322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6054186224937439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5540515184402466},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5477317571640015},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5270227193832397},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.520620584487915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4409600794315338},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.43266257643699646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43093156814575195},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41268616914749146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2621024549007416},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066677.1066768","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1500184949","https://openalex.org/W1614173585","https://openalex.org/W1976773489","https://openalex.org/W1980102547","https://openalex.org/W1986184086","https://openalex.org/W2005490762","https://openalex.org/W2058104638","https://openalex.org/W2061970672","https://openalex.org/W2127908756","https://openalex.org/W2138856440","https://openalex.org/W2155092906","https://openalex.org/W4206109200","https://openalex.org/W4239400817"],"related_works":["https://openalex.org/W4390949567","https://openalex.org/W3209732136","https://openalex.org/W1556645209","https://openalex.org/W2782243532","https://openalex.org/W2963991671","https://openalex.org/W2240703591","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W2189598663","https://openalex.org/W3037419933"],"abstract_inverted_index":{"We":[0,29,99,134],"study":[1],"the":[2,45,60,74,77,84,88,94,97,105,112,115,129,147,151,182,196,205],"computational":[3],"limits":[4],"of":[5,47,62,69,76,90,96,114,123,207],"Constraint":[6],"Satisfaction":[7],"Problems":[8],"(CSP's)":[9],"allowing":[10],"infinitely,":[11],"or":[12],"unboundedly,":[13],"many":[14],"indexed":[15],"variables":[16,48,63,91],"as":[17,34,53,55],"in,":[18],"e.g.,":[19],"xi":[20],">":[21],"xi+2":[22],"for":[23,80,156],"each":[24],"i":[25],"=":[26],"1,":[27],"2,....":[28],"refer":[30],"to":[31,140,146,176],"these":[32],"CSP's":[33,36],"Infinite":[35],"(ICSP's).":[37],"These":[38],"problems":[39,58],"arise":[40],"in":[41,43,56,111,138,159,166,174,181,201],"contexts":[42],"which":[44],"number":[46,61],"is":[49,132,154,215],"unknown":[50],"a":[51,65],"priori":[52],"well":[54],"optimization":[57],"wrt":[59,82],"satisfying":[64],"given":[66],"finite":[67],"set":[68],"constraints.In":[70],"particular,":[71],"we":[72,144,171,187,191],"investigate":[73],"decidability":[75],"satisfiability":[78,130,152,214],"problem":[79,131,153],"ICSP's":[81],"(a)":[83],"first-order":[85],"theory":[86,113,122,206],"specifying":[87],"indices":[89,106,157,198],"and":[92,109,164,178],"(b)":[93],"dimension":[95],"indices.":[98],"first":[100],"show":[101,172],"that":[102],"(1)":[103,177],"if":[104,143,186,195],"are":[107,199],"one-dimensional":[108,183,197],"specified":[110,158,200],"natural":[116],"numbers":[117],"with":[118],"linear":[119],"order":[120],"(the":[121],"(N,":[124,160,167,208],"0,":[125,161,168,209],"succ,":[126,162,210],"<))":[127],"then":[128,135,150,213],"decidable.":[133],"prove":[136],"that,":[137,173],"contrast":[139,175],"(1),":[141],"(2)":[142],"move":[145],"two-dimensional":[148],"case":[149,184],"undecidable":[155],"<)":[163],"even":[165],"succ).":[169],"Finally,":[170],"(2),":[179],"already":[180],"(3)":[185],"also":[188],"allow":[189],"addition,":[190],"get":[192],"undecidability.":[193],"I.e.,":[194],"Presburger":[202],"arithmetic":[203],"(i.e.,":[204],"<,":[211],"+))":[212],"undecidable.":[216]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}