{"id":"https://openalex.org/W2136195897","doi":"https://doi.org/10.1051/ita:2004017","title":"Comparing the succinctness of monadic query languages over finite trees","display_name":"Comparing the succinctness of monadic query languages over finite trees","publication_year":2004,"publication_date":"2004-10-01","ids":{"openalex":"https://openalex.org/W2136195897","doi":"https://doi.org/10.1051/ita:2004017","mag":"2136195897"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2004017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2004017","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany; grohe@informatik.hu-berlin.de.; schweika@informatik.hu-berlin.de","Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany; grohe@informatik.hu-berlin.de.; schweika@informatik.hu-berlin.de","institution_ids":[]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019365566","display_name":"Nicole Schweikardt","orcid":"https://orcid.org/0000-0001-5705-1675"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Schweikardt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany; grohe@informatik.hu-berlin.de.; schweika@informatik.hu-berlin.de","Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany; grohe@informatik.hu-berlin.de.; schweika@informatik.hu-berlin.de","institution_ids":[]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":2.023,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86920981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"4","first_page":"343","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/succinctness","display_name":"Succinctness","score":0.9852890968322754},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.8133705854415894},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5734551548957825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5330466032028198},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.5040299296379089},{"id":"https://openalex.org/keywords/philosophy-of-language","display_name":"Philosophy of language","score":0.46458369493484497},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44954296946525574},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.42976799607276917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4275815784931183},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4149410128593445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40104758739471436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3423587381839752},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19086068868637085},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1451326310634613},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12257272005081177},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.09026852250099182},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07153350114822388}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.9852890968322754},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.8133705854415894},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5734551548957825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5330466032028198},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.5040299296379089},{"id":"https://openalex.org/C123556308","wikidata":"https://www.wikidata.org/wiki/Q484761","display_name":"Philosophy of language","level":3,"score":0.46458369493484497},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44954296946525574},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.42976799607276917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4275815784931183},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4149410128593445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40104758739471436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3423587381839752},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19086068868637085},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1451326310634613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12257272005081177},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.09026852250099182},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07153350114822388},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C182744844","wikidata":"https://www.wikidata.org/wiki/Q35277","display_name":"Metaphysics","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita:2004017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2004017","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2004__38_4_343_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ita:2004017/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1482193060","https://openalex.org/W1489630028","https://openalex.org/W1528001973","https://openalex.org/W1535627680","https://openalex.org/W1556489160","https://openalex.org/W1558832481","https://openalex.org/W1970599921","https://openalex.org/W1982169430","https://openalex.org/W1984890936","https://openalex.org/W2003895694","https://openalex.org/W2066585576","https://openalex.org/W2069044506","https://openalex.org/W2070632872","https://openalex.org/W2098171268","https://openalex.org/W2103332648","https://openalex.org/W2114240051","https://openalex.org/W2124876285","https://openalex.org/W2131159347","https://openalex.org/W2137257773","https://openalex.org/W2137935204","https://openalex.org/W2171680292","https://openalex.org/W2175748456","https://openalex.org/W4236835455","https://openalex.org/W4251068495","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2109725814","https://openalex.org/W2136195897","https://openalex.org/W2087528959","https://openalex.org/W1528001973","https://openalex.org/W3121709727","https://openalex.org/W1502477797","https://openalex.org/W2090079575","https://openalex.org/W2963679208","https://openalex.org/W1560546362","https://openalex.org/W4237831588"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,25,35,78,84],"succinctness":[3],"of":[4,11,77,89],"monadic":[5,12,53,61,74],"second-order":[6,54],"logic":[7,55],"and":[8,86],"a":[9],"variety":[10],"fixed":[13,63],"point":[14,64],"logics":[15],"on":[16,29],"trees.":[17],"All":[18],"these":[19,93],"languages":[20,79],"are":[21],"known":[22],"to":[23,83],"have":[24],"same":[26,36],"expressive":[27],"power":[28],"trees,":[30],"but":[31],"some":[32,49],"can":[33],"express":[34],"queries":[37],"much":[38],"more":[39,58,71],"succinctly":[40],"than":[41,60,73],"others.":[42],"For":[43],"example,":[44],"we":[45],"show":[46],"that,":[47],"under":[48],"complexity":[50,88],"theoretic":[51],"assumption,":[52],"is":[56,69,80],"non-elementarily":[57,70],"succinct":[59,72],"least":[62],"logic,":[65],"which":[66],"in":[67],"turn":[68],"datalog.":[75],"Succinctness":[76],"closely":[81],"related":[82],"combined":[85],"parameterised":[87],"query":[90],"evaluation":[91],"for":[92],"languages.":[94]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}