{"id":"https://openalex.org/W1528001973","doi":"https://doi.org/10.1007/978-3-540-45220-1_20","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":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1528001973","doi":"https://doi.org/10.1007/978-3-540-45220-1_20","mag":"1528001973"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-45220-1_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45220-1_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Laboratory for Foundations of Computer Science, University of Edinburgh, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"Laboratory for Foundations of Computer Science, University of Edinburgh, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"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/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicole Schweikardt","raw_affiliation_strings":["Laboratory for Foundations of Computer Science, University of Edinburgh, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"Laboratory for Foundations of Computer Science, University of Edinburgh, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.6004,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.9446173,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/succinctness","display_name":"Succinctness","score":0.982284426689148},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.8133618235588074},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6687270998954773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6460180282592773},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.6058850884437561},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5820809602737427},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.5123096704483032},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4417336881160736},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43679752945899963},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4132493734359741},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34929364919662476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33600205183029175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23498785495758057},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.17798703908920288},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12066498398780823},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.10742795467376709},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07808694243431091}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.982284426689148},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.8133618235588074},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6687270998954773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6460180282592773},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.6058850884437561},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5820809602737427},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.5123096704483032},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4417336881160736},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43679752945899963},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4132493734359741},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34929364919662476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33600205183029175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23498785495758057},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.17798703908920288},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12066498398780823},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.10742795467376709},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07808694243431091},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-540-45220-1_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45220-1_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.112.4686","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4686","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.hu-berlin.de/~grohe/pub/csl03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.527.4916","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.527.4916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-stud.rbi.informatik.uni-frankfurt.de/~schweika/downloads/Succinctness_ITA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.572.9011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.9011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/jogu/GS_CSL03_TechRep.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.576.5024","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.576.5024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/jogu/GS_CSL03_ProcVersion.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"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/W1568768396","https://openalex.org/W1699388987","https://openalex.org/W1816620374","https://openalex.org/W1970599921","https://openalex.org/W1984890936","https://openalex.org/W2003304137","https://openalex.org/W2003895694","https://openalex.org/W2047674711","https://openalex.org/W2069044506","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/W2137931097","https://openalex.org/W2137935204","https://openalex.org/W2161892027","https://openalex.org/W2171680292","https://openalex.org/W2175748456","https://openalex.org/W4206031975","https://openalex.org/W4236835455","https://openalex.org/W4241604193","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W56994778","https://openalex.org/W1490897486","https://openalex.org/W84120850","https://openalex.org/W1528001973","https://openalex.org/W2109725814","https://openalex.org/W2136195897","https://openalex.org/W2087528959","https://openalex.org/W2017699072","https://openalex.org/W2294842961","https://openalex.org/W3121709727"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}