{"id":"https://openalex.org/W2016416699","doi":"https://doi.org/10.1145/1838552.1838555","title":"Monadic datalog over finite structures of bounded treewidth","display_name":"Monadic datalog over finite structures of bounded treewidth","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2016416699","doi":"https://doi.org/10.1145/1838552.1838555","mag":"2016416699"},"language":"en","primary_location":{"id":"doi:10.1145/1838552.1838555","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1838552.1838555","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-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/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Oxford University, Oxford, U.K"],"affiliations":[{"raw_affiliation_string":"Oxford University, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091683403","display_name":"Reinhard Pichler","orcid":"https://orcid.org/0000-0002-1760-122X"},"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":"Reinhard Pichler","raw_affiliation_strings":["Technische Universit\u00e4t Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110199019","display_name":"Fang Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fang Wei","raw_affiliation_strings":["Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":4.098,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93904192,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9970999956130981,"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.9970999956130981,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9952999949455261,"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/T10142","display_name":"Formal Methods in Verification","score":0.995199978351593,"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.9514082074165344},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8754330277442932},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7665896415710449},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.6417059302330017},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5543347597122192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.518955409526825},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4554055631160736},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.449008971452713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4457133114337921},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4200121760368347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3692997694015503},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3275424838066101},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.28692886233329773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2136560082435608},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20256057381629944},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1850479245185852},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08395355939865112}],"concepts":[{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.9514082074165344},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8754330277442932},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7665896415710449},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.6417059302330017},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5543347597122192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.518955409526825},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4554055631160736},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.449008971452713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4457133114337921},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4200121760368347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3692997694015503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3275424838066101},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.28692886233329773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2136560082435608},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20256057381629944},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1850479245185852},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08395355939865112},{"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/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"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":5,"locations":[{"id":"doi:10.1145/1838552.1838555","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1838552.1838555","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.311.3570","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.311.3570","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/0809.3140v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.4022","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4022","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dbai.tuwien.ac.at/staff/wei/papers/pods061-gottlob.pdf","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:87749ddc-519a-4d9c-abbf-ef0dd61c772f","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:87749ddc-519a-4d9c-abbf-ef0dd61c772f","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:f73eca07-b7d0-4c3c-afe5-8558cbf3fa56","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:f73eca07-b7d0-4c3c-afe5-8558cbf3fa56","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5868504831","display_name":null,"funder_award_id":"P20704-N18","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W51516856","https://openalex.org/W98741451","https://openalex.org/W143512583","https://openalex.org/W144096106","https://openalex.org/W1489366126","https://openalex.org/W1498546115","https://openalex.org/W1509428113","https://openalex.org/W1524939943","https://openalex.org/W1526647587","https://openalex.org/W1527664624","https://openalex.org/W1550020009","https://openalex.org/W1558832481","https://openalex.org/W1562478345","https://openalex.org/W1570425181","https://openalex.org/W1576467656","https://openalex.org/W1584587517","https://openalex.org/W1648163228","https://openalex.org/W1776373986","https://openalex.org/W1816620374","https://openalex.org/W1818617877","https://openalex.org/W1872506843","https://openalex.org/W1967809203","https://openalex.org/W1970599921","https://openalex.org/W1976055110","https://openalex.org/W1987469449","https://openalex.org/W1989556004","https://openalex.org/W1989783863","https://openalex.org/W1991520222","https://openalex.org/W1992040352","https://openalex.org/W1992810975","https://openalex.org/W2007155273","https://openalex.org/W2008029457","https://openalex.org/W2011992362","https://openalex.org/W2021180976","https://openalex.org/W2028357390","https://openalex.org/W2035020702","https://openalex.org/W2037583170","https://openalex.org/W2046652577","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2066585576","https://openalex.org/W2066867008","https://openalex.org/W2070632872","https://openalex.org/W2073539738","https://openalex.org/W2073663206","https://openalex.org/W2079107830","https://openalex.org/W2085467680","https://openalex.org/W2087142904","https://openalex.org/W2100657934","https://openalex.org/W2106082215","https://openalex.org/W2122238039","https://openalex.org/W2130895537","https://openalex.org/W2135105491","https://openalex.org/W2139148854","https://openalex.org/W2145813209","https://openalex.org/W2162621793","https://openalex.org/W2166534810","https://openalex.org/W2174973502","https://openalex.org/W2394842790","https://openalex.org/W2561675875","https://openalex.org/W2748837517","https://openalex.org/W2913688336","https://openalex.org/W4213368513","https://openalex.org/W4292230561","https://openalex.org/W6629417139","https://openalex.org/W6631072894","https://openalex.org/W6631497791","https://openalex.org/W6638352968"],"related_works":["https://openalex.org/W1576158606","https://openalex.org/W1515656813","https://openalex.org/W1481567709","https://openalex.org/W2950585779","https://openalex.org/W2075018493","https://openalex.org/W4300073857","https://openalex.org/W2053806278","https://openalex.org/W2160667281","https://openalex.org/W2963886128","https://openalex.org/W2016416699"],"abstract_inverted_index":{"Bounded":[0],"treewidth":[1],"and":[2,184,231,298,320],"monadic":[3,116,163,247,295],"second-order":[4],"(MSO)":[5],"logic":[6],"have":[7,48],"proved":[8],"to":[9,59,93,104,131,227,234,259,270,275,308],"be":[10,38,56,79,94,157,219],"key":[11],"concepts":[12],"in":[13,40,150,221,333],"establishing":[14],"fixed-parameter":[15,136],"tractability":[16,267],"results.":[17],"Indeed,":[18],"by":[19,33,63,159,173,310],"Courcelle's":[20,53,255,271],"Theorem":[21,54],"we":[22,114,171,198,209,273],"know":[23],"that":[24,141,175,187,212],"any":[25],"property":[26,144,154],"of":[27,108,135,145,161,190,204,216,241,254,279,292,318,325,339],"finite":[28,83,146],"structures,":[29],"which":[30,286],"is":[31,148,179,268,306,337],"expressible":[32,149],"an":[34,128,242,251,300],"MSO":[35,66,100,151,243],"sentence,":[36],"can":[37,55,77,155,218],"decided":[39],"linear":[41,222],"time":[42,223],"(data":[43],"complexity)":[44],"if":[45,142,330],"the":[46,65,109,167,176,195,201,213,228,235,293,315,322],"structures":[47,147],"bounded":[49],"treewidth.":[50],"In":[51,111,194,257],"principle,":[52],"applied":[57],"directly":[58],"construct":[60,261],"concrete":[61],"algorithms":[62,263],"transforming":[64],"evaluation":[67],"problem":[68,317,324],"into":[69,245],"a":[70,82,105,162,246,277,289,334,340,349],"tree":[71,84,192],"language":[72],"recognition":[73],"problem.":[74],"The":[75],"latter":[76],"then":[78,152],"solved":[80],"via":[81],"automaton":[85],"(FTA).":[86],"However,":[87,208],"this":[88,112,133,153,174],"approach":[89,305],"has":[90],"turned":[91],"out":[92],"problematical,":[95],"since":[96],"even":[97],"relatively":[98],"simple":[99],"formulae":[101],"may":[102],"lead":[103],"\u201cstate":[106],"explosion\u201d":[107],"FTA.":[110],"work":[113,309],"propose":[115,274],"datalog":[117,119,164,217,248,285,296,312],"(i.e.,":[118,281,328],"where":[120],"all":[121],"intentional":[122],"predicate":[123],"symbols":[124],"are":[125],"unary)":[126],"as":[127],"alternative":[129,252],"method":[130],"tackle":[132],"class":[134],"tractable":[137],"problems.":[138],"We":[139,342],"show":[140,211],"some":[143,331],"also":[156,210,343],"expressed":[158],"means":[160],"program":[165,229,249],"over":[166],"decomposed":[168],"structure":[169,178],":":[170],"mean":[172],"original":[177],"augmented":[180],"with":[181,225,232,348],"new":[182,185,304],"elements":[183],"relations":[186],"encode":[188],"one":[189],"its":[191],"decompositions.":[193],"first":[196],"place,":[197],"thus":[199],"compare":[200],"expressive":[202],"power":[203],"two":[205],"query":[206,244],"languages.":[207],"resulting":[214],"fragment":[215,278],"evaluated":[220],"(both":[224],"respect":[226,233],"size":[230],"data":[236],"size).":[237],"Hence,":[238],"our":[239],"transformation":[240],"yields":[250],"proof":[253],"Theorem.":[256],"order":[258],"actually":[260],"efficient":[262,301],"for":[264,288,299,314,321],"problems":[265],"whose":[266],"due":[269],"Theorem,":[272],"use":[276],"full":[280],"not":[282],"necessarily":[283],"monadic)":[284],"allows":[287],"succinct":[290],"representation":[291],"corresponding":[294],"programs":[297,313],"execution.":[302],"This":[303],"put":[307],"devising":[311],"3-Colorability":[316],"graphs":[319],"PRIMALITY":[323],"relational":[326,335],"schemas":[327],"testing":[329],"attribute":[332],"schema":[336],"part":[338],"key).":[341],"report":[344],"on":[345],"experimental":[346],"results":[347],"prototype":[350],"implementation.":[351]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}