{"id":"https://openalex.org/W7143433874","doi":"https://doi.org/10.1007/s00224-026-10261-2","title":"Symmetric Linear Arc Monadic Datalog and Gadget Reductions","display_name":"Symmetric Linear Arc Monadic Datalog and Gadget Reductions","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7143433874","doi":"https://doi.org/10.1007/s00224-026-10261-2"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-026-10261-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-026-10261-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-026-10261-2.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-026-10261-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130988458","display_name":"Manuel Bodirsky","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Manuel Bodirsky","raw_affiliation_strings":["Institut f\u00fcr Algebra, TU Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Algebra, TU Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075327267","display_name":"Florian Starke","orcid":"https://orcid.org/0000-0003-2360-9364"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Florian Starke","raw_affiliation_strings":["Institut f\u00fcr Algebra, TU Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Algebra, TU Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075327267"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.77126654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8055999875068665,"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.8055999875068665,"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.08780000358819962,"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.04809999838471413,"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/datalog","display_name":"Datalog","score":0.9739999771118164},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5855000019073486},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4575999975204468},{"id":"https://openalex.org/keywords/gadget","display_name":"Gadget","score":0.4569000005722046},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4555000066757202},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3986000120639801},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.39329999685287476},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.3797999918460846},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.3776000142097473}],"concepts":[{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.9739999771118164},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5855000019073486},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4575999975204468},{"id":"https://openalex.org/C119770614","wikidata":"https://www.wikidata.org/wiki/Q5516347","display_name":"Gadget","level":2,"score":0.4569000005722046},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4555000066757202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447000026702881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43290001153945923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4323999881744385},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3776000142097473},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32679998874664307},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3037000000476837},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2948000133037567},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.2879999876022339},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2822999954223633},{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-026-10261-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-026-10261-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-026-10261-2.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00224-026-10261-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-026-10261-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-026-10261-2.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1304993860","display_name":null,"funder_award_id":"101071674","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321613","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7143433874.pdf","grobid_xml":"https://content.openalex.org/works/W7143433874.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1486752157","https://openalex.org/W1529356409","https://openalex.org/W1549147858","https://openalex.org/W1560586330","https://openalex.org/W1570219696","https://openalex.org/W1825515612","https://openalex.org/W1965377399","https://openalex.org/W1979119667","https://openalex.org/W1979514837","https://openalex.org/W1993886628","https://openalex.org/W2027524199","https://openalex.org/W2034079307","https://openalex.org/W2053204108","https://openalex.org/W2055686117","https://openalex.org/W2071035573","https://openalex.org/W2120593287","https://openalex.org/W2124452950","https://openalex.org/W2124864854","https://openalex.org/W2128522328","https://openalex.org/W2138857669","https://openalex.org/W2139405657","https://openalex.org/W2150339067","https://openalex.org/W2164286489","https://openalex.org/W2165528704","https://openalex.org/W2166566648","https://openalex.org/W2172286136","https://openalex.org/W2504299149","https://openalex.org/W2962785950","https://openalex.org/W2963295189","https://openalex.org/W2963666051","https://openalex.org/W2963768895","https://openalex.org/W2964077202","https://openalex.org/W3007452340","https://openalex.org/W3015111182","https://openalex.org/W3081785465","https://openalex.org/W4230417672","https://openalex.org/W4235890131","https://openalex.org/W4303982828","https://openalex.org/W4392925261","https://openalex.org/W4399889319"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1],"Datalog":[2,30,42,45,50,62,79,92,183],"program":[3,93,184],"solves":[4],"a":[5,90,98,102,116,173,181],"constraint":[6,38,105],"satisfaction":[7,106],"problem":[8],"(CSP)":[9],"if":[10,13],"and":[11,47,126,141],"only":[12],"it":[14],"derives":[15],"the":[16,21,25,59,83,135,170],"goal":[17],"predicate":[18],"precisely":[19],"on":[20],"unsatisfiable":[22],"instances":[23],"of":[24,61,67,115,137,145],"CSP.":[26],"There":[27],"are":[28,33],"three":[29],"fragments":[31],"that":[32,85,96,169],"particularly":[34],"important":[35],"for":[36,149],"finite-domain":[37,175],"satisfaction:":[39],"arc":[40,76],"monadic":[41,77],",":[43,46,51,148],"linear":[44,49,75],"symmetric":[48,74],"each":[52],"having":[53],"good":[54],"computational":[55],"properties.":[56],"We":[57,81,108],"consider":[58],"fragment":[60],"where":[63],"we":[64,72,120],"impose":[65],"all":[66,150],"these":[68],"restrictions":[69],"simultaneously,":[70],"i.e.,":[71],"study":[73],"(slam)":[78],".":[80],"characterise":[82],"CSPs":[84],"can":[86,177],"be":[87,178],"solved":[88],"by":[89,180],"slam":[91,182],"as":[94],"those":[95],"have":[97],"gadget":[99],"reduction":[100],"to":[101],"particular":[103],"Boolean":[104],"problem.":[107],"also":[109,167],"present":[110],"exact":[111],"characterisations":[112,166],"in":[113,127],"terms":[114,129],"homomorphism":[117],"duality":[118,124],"(which":[119],"call":[121],"unfolded":[122],"caterpillar":[123],"),":[125],"universal-algebraic":[128],"(using":[130],"known":[131],"minor":[132],"conditions,":[133],"namely":[134],"existence":[136],"quasi":[138],"Maltsev":[139],"operations":[140,144],"k":[142],"-absorptive":[143],"arity":[146],"nk":[147],"$$n,k":[151],"\\ge":[152],"1$$":[153],"<mml:math":[154],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[155],"<mml:mrow>":[156],"<mml:mi>n</mml:mi>":[157],"<mml:mo>,</mml:mo>":[158],"<mml:mi>k</mml:mi>":[159],"<mml:mo>\u2265</mml:mo>":[160],"<mml:mn>1</mml:mn>":[161],"</mml:mrow>":[162],"</mml:math>":[163],").":[164],"Our":[165],"imply":[168],"question":[171],"whether":[172],"given":[174],"CSP":[176],"expressed":[179],"is":[185],"decidable.":[186]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2026-03-31T00:00:00"}