{"id":"https://openalex.org/W4242963547","doi":"https://doi.org/10.1109/lics.2017.8005128","title":"The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems","display_name":"The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4242963547","doi":"https://doi.org/10.1109/lics.2017.8005128"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","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/A5071004419","display_name":"Libor Barto","orcid":"https://orcid.org/0000-0002-8481-6458"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Libor Barto","raw_affiliation_strings":["Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063365809","display_name":"Michael Kompatscher","orcid":"https://orcid.org/0000-0002-0163-6604"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Michael Kompatscher","raw_affiliation_strings":["Institut f\u00fcr Computersprachen, Theory and Logic Group, Technische Universit\u00e4t Wien Favoritenstrasse 9/E1852, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Computersprachen, Theory and Logic Group, Technische Universit\u00e4t Wien Favoritenstrasse 9/E1852, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028924645","display_name":"Miroslav Ol\u0161\u00e1k","orcid":"https://orcid.org/0000-0002-9361-1921"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Miroslav Olsak","raw_affiliation_strings":["Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075891344","display_name":"Trung Van Pham","orcid":"https://orcid.org/0000-0003-3019-9973"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Trung Van Pham","raw_affiliation_strings":["Institut f\u00fcr Computersprachen, Theory and Logic Group, Technische Universitat Wien, Wien, Wien, AT"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Computersprachen, Theory and Logic Group, Technische Universitat Wien, Wien, Wien, AT","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070658141","display_name":"Michael Pinsker","orcid":"https://orcid.org/0000-0002-4727-918X"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michael Pinsker","raw_affiliation_strings":["Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, Faculty of Mathematics and Physics, Charles University in Prague Sokolovsk\u00e1 83, Praha 8, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5071004419"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":3.3851,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92904509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9922000169754028,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9746999740600586,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7920066714286804},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6820225715637207},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6336051225662231},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5791637897491455},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5546843409538269},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5341089963912964},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5043278932571411},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.47443997859954834},{"id":"https://openalex.org/keywords/structured-program-theorem","display_name":"Structured program theorem","score":0.4705802798271179},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.460918664932251},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.43873846530914307},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.417986124753952},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.11315527558326721}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7920066714286804},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6820225715637207},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6336051225662231},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5791637897491455},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5546843409538269},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5341089963912964},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5043278932571411},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.47443997859954834},{"id":"https://openalex.org/C180375552","wikidata":"https://www.wikidata.org/wiki/Q2635326","display_name":"Structured program theorem","level":2,"score":0.4705802798271179},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.460918664932251},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.43873846530914307},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.417986124753952},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.11315527558326721},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2017.8005128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W417925666","https://openalex.org/W1601269853","https://openalex.org/W1784570274","https://openalex.org/W1863800201","https://openalex.org/W1967190838","https://openalex.org/W1968276645","https://openalex.org/W1976863752","https://openalex.org/W2058971493","https://openalex.org/W2069388397","https://openalex.org/W2087215337","https://openalex.org/W2100984870","https://openalex.org/W2108266191","https://openalex.org/W2150339067","https://openalex.org/W2158012017","https://openalex.org/W2276690803","https://openalex.org/W2292152734","https://openalex.org/W2598159508","https://openalex.org/W2963269037","https://openalex.org/W2963666051","https://openalex.org/W2963844545","https://openalex.org/W3038109304","https://openalex.org/W3102244937","https://openalex.org/W3103815471","https://openalex.org/W3104398743","https://openalex.org/W3121566589","https://openalex.org/W6693988119","https://openalex.org/W6696967654","https://openalex.org/W6785666667"],"related_works":["https://openalex.org/W3021221643","https://openalex.org/W3184046060","https://openalex.org/W3061362066","https://openalex.org/W2626872748","https://openalex.org/W2751025771","https://openalex.org/W1990734013","https://openalex.org/W2155910042","https://openalex.org/W70192758","https://openalex.org/W1492779419","https://openalex.org/W2406415335"],"abstract_inverted_index":{"There":[0],"exist":[1],"two":[2,119,141],"conjectures":[3,120],"for":[4,102,166,211],"constraint":[5],"satisfaction":[6],"problems":[7],"(CSPs)":[8],"of":[9,11,22,25,98,108,139,159,180,191,203,215,217,239,241],"reducts":[10,216],"finitely":[12,193],"bounded":[13,194],"homogeneous":[14,161],"structures:":[15],"the":[16,23,31,55,68,81,91,95,105,118,137,140,156,218,221,225,237,242],"first":[17],"one":[18],"states":[19,62],"that":[20,63,90,117,130,177,245],"tractability":[21,64],"CSP":[24],"such":[26],"a":[27,34,43,99,127,145,149,160,168,192,200,231,253],"structure":[28,32,100,162,195,248],"is,":[29],"when":[30],"is":[33,65,133,185,249],"model-complete":[35,58,146,254],"core,":[36],"equivalent":[37,66,251],"to":[38,67,115,135,252],"its":[39,76,109],"polymorphism":[40,96,179],"clone":[41,97],"satisfying":[42],"certain":[44],"non-trivial":[45,201,208],"linear":[46,69,204,209],"identity":[47],"modulo":[48,188],"outer":[49,72,189],"embeddings.":[50],"The":[51],"second":[52],"conjecture,":[53],"challenging":[54],"approach":[56],"via":[57],"cores":[59],"by":[60,75],"reflections,":[61],"identities":[70,92,210],"(without":[71],"embeddings)":[73],"satisfied":[74,93],"polymorphisms":[77],"clone,":[78],"together":[79],"with":[80,126],"natural":[82],"uniformity":[83],"on":[84],"it,":[85],"being":[86],"non-trivial.":[87],"We":[88,123,174],"prove":[89,176],"in":[94,144,236],"allow":[101],"conclusions":[103],"about":[104],"orbit":[106],"growth":[107],"automorphism":[110],"group,":[111],"and":[112,206,224,233],"apply":[113],"this":[114,125],"show":[116,154],"are":[121],"equivalent.":[122],"contrast":[124],"counterexample":[128],"showing":[129],"\u03c9-categoricity":[131],"alone":[132],"insufficient":[134],"imply":[136],"equivalence":[138,170],"conditions":[142],"above":[143],"core.":[147,255],"Taking":[148],"different":[150,172],"approach,":[151],"we":[152,229],"then":[153,175],"how":[155],"Ramsey":[157],"property":[158],"can":[163,196],"be":[164,197],"utilized":[165],"obtaining":[167],"similar":[169],"under":[171],"conditions.":[173],"any":[178],"sufficiently":[181],"large":[182],"arity":[183],"which":[184],"totally":[186],"symmetric":[187],"embeddings":[190],"turned":[198],"into":[199],"system":[202],"identities,":[205],"obtain":[207],"all":[212],"tractable":[213],"cases":[214],"rational":[219],"order,":[220],"random":[222,226],"graph,":[223],"poset.":[227],"Finally,":[228],"provide":[230],"new":[232],"short":[234],"proof,":[235],"language":[238],"monoids,":[240],"theorem":[243],"stating":[244],"every":[246],"\u03c9-categorical":[247],"homomorphically":[250]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}