{"id":"https://openalex.org/W2120593287","doi":"https://doi.org/10.1093/logcom/exu003","title":"On constraint satisfaction problems below P","display_name":"On constraint satisfaction problems below P","publication_year":2014,"publication_date":"2014-02-13","ids":{"openalex":"https://openalex.org/W2120593287","doi":"https://doi.org/10.1093/logcom/exu003","mag":"2120593287"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exu003","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exu003","pdf_url":"https://academic.oup.com/logcom/article-pdf/26/3/893/7949135/exu003.pdf","source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://academic.oup.com/logcom/article-pdf/26/3/893/7949135/exu003.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042337191","display_name":"L\u00e1szl\u00f3 Egri","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA","HU"],"is_corresponding":true,"raw_author_name":"L\u00e1szl\u00f3 Egri","raw_affiliation_strings":["Concordia University, Montreal, Canada and Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary.  E-mail: laszlo.egri@mail.mcgill.ca","Concordia University, Montreal, Canada and Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary. E-mail: laszlo.egri@mail.mcgill.ca"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Concordia University, Montreal, Canada and Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary.  E-mail: laszlo.egri@mail.mcgill.ca","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University, Montreal, Canada and Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary. E-mail: laszlo.egri@mail.mcgill.ca","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042337191"],"corresponding_institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I60158472"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.6986,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73577997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"3","first_page":"893","last_page":"922"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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/T11567","display_name":"semigroups and automata theory","score":0.996399998664856,"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/datalog","display_name":"Datalog","score":0.973853588104248},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7094488143920898},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.633709192276001},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.604881763458252},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5830992460250854},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4834524095058441},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.482567697763443},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.464399129152298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.454153448343277},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44604599475860596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3813275694847107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3732183575630188},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.28722435235977173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24105697870254517},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13447779417037964}],"concepts":[{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.973853588104248},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7094488143920898},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.633709192276001},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.604881763458252},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5830992460250854},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4834524095058441},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.482567697763443},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.464399129152298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.454153448343277},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44604599475860596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3813275694847107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3732183575630188},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.28722435235977173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24105697870254517},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13447779417037964},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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":3,"locations":[{"id":"doi:10.1093/logcom/exu003","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exu003","pdf_url":"https://academic.oup.com/logcom/article-pdf/26/3/893/7949135/exu003.pdf","source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.746.4463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.746.4463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1312.4428.pdf","raw_type":"text"},{"id":"pmh:oai:open-archive.highwire.org:logcom:26/3/893","is_oa":false,"landing_page_url":"http://logcom.oxfordjournals.org/cgi/content/short/26/3/893","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","issn_l":null,"issn":null,"is_oa":false,"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":"","raw_type":"TEXT"}],"best_oa_location":{"id":"doi:10.1093/logcom/exu003","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exu003","pdf_url":"https://academic.oup.com/logcom/article-pdf/26/3/893/7949135/exu003.pdf","source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2120593287.pdf","grobid_xml":"https://content.openalex.org/works/W2120593287.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1486752157","https://openalex.org/W1488809080","https://openalex.org/W1489366126","https://openalex.org/W1508474696","https://openalex.org/W1524176804","https://openalex.org/W1874576524","https://openalex.org/W1969223164","https://openalex.org/W1996330905","https://openalex.org/W2001101327","https://openalex.org/W2023648368","https://openalex.org/W2027524199","https://openalex.org/W2028556486","https://openalex.org/W2034079307","https://openalex.org/W2045583023","https://openalex.org/W2046284526","https://openalex.org/W2084214245","https://openalex.org/W2124452950","https://openalex.org/W2124864854","https://openalex.org/W2128522328","https://openalex.org/W2150339067","https://openalex.org/W2164286489","https://openalex.org/W2166566648","https://openalex.org/W2171280299","https://openalex.org/W4236835455","https://openalex.org/W4293176479"],"related_works":["https://openalex.org/W1481567709","https://openalex.org/W2950585779","https://openalex.org/W2016416699","https://openalex.org/W4287865589","https://openalex.org/W3031230092","https://openalex.org/W2951257011","https://openalex.org/W3007918591","https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W56447744"],"abstract_inverted_index":{"Symmetric":[0],"Datalog,":[1,9,77],"a":[2,32,49,85,106,169],"fragment":[3],"of":[4,75,90,112,115,137,147,172,197],"the":[5,73,113,134,138,145,182],"logic":[6],"programming":[7],"language":[8],"is":[10,40,45,51,159],"conjectured":[11],"to":[12],"capture":[13],"all":[14],"constraint":[15],"satisfaction":[16],"problems":[17],"(CSP)":[18],"in":[19,37,53,157,161],"L":[20],".":[21],"Therefore":[22],"developing":[23],"tools":[24],"that":[25,48,62,119,154,168],"help":[26],"us":[27],"understand":[28],"whether":[29],"or":[30],"not":[31,176],"CSP":[33,50,63,156],"can":[34],"be":[35,190],"defined":[36,191],"symmetric":[38,76,124],"Datalog":[39,54,57,122],"an":[41],"important":[42],"task.":[43],"It":[44],"widely":[46],"known":[47],"definable":[52,160],"and":[55,59,67,80,99,108,117],"linear":[56,162],"if":[58,61],"only":[60],"has":[64],"bounded":[65,68,178],"treewidth":[66],"pathwidth":[69,179],"duality,":[70],"respectively.":[71],"In":[72,102,133],"case":[74],"Bulatov,":[78],"Krokhin":[79],"Larose":[81,118],"ask":[82],"for":[83,144],"such":[84,97],"duality":[86,180],"(2008,":[87,126],"Vol.":[88],"5250":[89],"LNCS":[91],",":[92,131,152],"93\u2013124).":[93],"We":[94],"provide":[95,141],"two":[96],"dualities,":[98],"give":[100,105],"applications.":[101],"particular,":[103],"we":[104,140],"short":[107],"simple":[109],"new":[110],"proof":[111],"result":[114],"Dalmau":[116,148],"\u2018Maltsev":[120],"+":[121],"\u21d2":[123],"Datalog\u2019":[125],"IEEE":[127],"Symposium":[128],"on":[129],"LICS":[130],"297\u2013306).":[132],"second":[135],"part":[136],"article,":[139],"some":[142],"evidence":[143],"conjecture":[146],"(2002,":[149],"Proc.":[150],"ICALP":[151],"414\u2013425)":[153],"every":[155],"NL":[158],"Datalog.":[163],"Our":[164],"results":[165],"also":[166],"show":[167],"wide":[170],"class":[171],"CSPs\u2013CSPs":[173],"which":[174],"do":[175],"have":[177],"(e.g.":[181],"P":[183],"-complete":[184],"H":[185],"orn":[186],"-3S":[187],"at":[188],"problem)\u2013cannot":[189],"by":[192],"any":[193],"polynomial":[194],"size":[195],"family":[196],"monotone":[198],"read-once":[199],"non-deterministic":[200],"branching":[201],"programs.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}