{"id":"https://openalex.org/W2017018565","doi":"https://doi.org/10.1109/lics.2013.12","title":"Two-Variable Logic with Counting and Trees","display_name":"Two-Variable Logic with Counting and Trees","alternate_titles":[],"publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2017018565","doi":"https://doi.org/10.1109/lics.2013.12","mag":"2017018565"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2013.12","doi":"https://doi.org/10.1109/lics.2013.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2013.12","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2017018565"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5068443996","display_name":"Witold Charatonik","orcid":"https://orcid.org/0000-0001-7062-0385","observed_orcids":["https://orcid.org/0000-0001-7062-0385"]},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Witold Charatonik","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Poland","Institute of Computer Science, University of Wroclaw, Wroclaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962"]},{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068506948","display_name":"Piotr Witkowski","orcid":"https://orcid.org/0000-0002-1908-0827","observed_orcids":["https://orcid.org/0000-0002-1908-0827"]},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Piotr Witkowski","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Poland","Institute of Computer Science, University of Wroclaw, Wroclaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962"]},{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":4.6193,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.9622931,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"82"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.4611999988555908,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.4611999988555908,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.155799999833107,"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.133200004696846,"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/two-variable-logic","display_name":"two-variable logic","score":0.8299999833106995},{"id":"https://openalex.org/keywords/counting-quantifiers","display_name":"counting quantifiers","score":0.9589999914169312},{"id":"https://openalex.org/keywords/forests","display_name":"forests","score":0.703000009059906},{"id":"https://openalex.org/keywords/finite-structures","display_name":"finite structures","score":0.7149999737739563},{"id":"https://openalex.org/keywords/expressiveness","display_name":"expressiveness","score":0.5180000066757202},{"id":"https://openalex.org/keywords/satisfiability","display_name":"satisfiability","score":0.7129999995231628},{"id":"https://openalex.org/keywords/decision-making-methods","display_name":"decision procedures","score":0.8389999866485596},{"id":"https://openalex.org/keywords/nexptime-completeness","display_name":"NEXPTIME-completeness","score":0.9039999842643738},{"id":"https://openalex.org/keywords/bounded-degree-graphs","display_name":"bounded degree graphs","score":0.621999979019165},{"id":"https://openalex.org/keywords/cycles","display_name":"cycles","score":0.3619999885559082}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6681989431381226},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.5608112812042236},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5592686533927917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4947149455547333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.477022647857666},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4539884328842163},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4381338357925415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43808242678642273},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4110289216041565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39963385462760925},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3074774146080017},{"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/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2013.12","doi":"https://doi.org/10.1109/lics.2013.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2013.12","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"ACM/IEEE Symposium on Logic in Computer Science (LICS)","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W6480589","https://openalex.org/W133313031","https://openalex.org/W1488636480","https://openalex.org/W1489366126","https://openalex.org/W1517830222","https://openalex.org/W1564256547","https://openalex.org/W1607294421","https://openalex.org/W1619948012","https://openalex.org/W1997817571","https://openalex.org/W2008070102","https://openalex.org/W2036564813","https://openalex.org/W2086470346","https://openalex.org/W2099081288","https://openalex.org/W2104419987","https://openalex.org/W2121515872","https://openalex.org/W2124580444","https://openalex.org/W2132205083","https://openalex.org/W2136823804","https://openalex.org/W2166108892","https://openalex.org/W2258592034","https://openalex.org/W2293300167","https://openalex.org/W4299576623","https://openalex.org/W6652458401"],"related_works":["https://openalex.org/W2906987173","https://openalex.org/W2166108892","https://openalex.org/W2278869178","https://openalex.org/W1971102936","https://openalex.org/W2554629120","https://openalex.org/W2099081288","https://openalex.org/W1997817571","https://openalex.org/W4377031857","https://openalex.org/W4377031866"],"abstract_inverted_index":{"We":[0,83],"consider":[1],"the":[2,36,68,89,104],"two-variable":[3],"logic":[4,21,70],"with":[5,71],"counting":[6],"quantifiers":[7],"(C2)":[8],"interpreted":[9],"over":[10],"finite":[11,80],"structures":[12],"that":[13,45],"contain":[14],"two":[15,72,75,79],"forests":[16],"of":[17,35,58,78],"ranked":[18,50],"trees.":[19],"This":[20],"is":[22,30,48,62,101],"strictly":[23,64],"more":[24,65],"expressive":[25,66],"than":[26,67],"standard":[27],"C2and":[28],"it":[29,42],"no":[31],"longer":[32],"a":[33,46,49,52,55,85],"fragment":[34],"first":[37],"order":[38],"logic.":[39,94],"In":[40],"particular,":[41],"can":[43],"express":[44],"structure":[47],"tree,":[51],"cycle":[53],"or":[54],"connected":[56],"graph":[57],"bounded":[59],"degree.":[60],"It":[61],"also":[63],"first-order":[69],"variables":[73],"and":[74],"successor":[76],"relations":[77],"linear":[81],"orders.":[82],"give":[84],"decision":[86],"procedure":[87,96],"for":[88,92,107],"satisfiability":[90,105],"problem":[91,106],"this":[93],"The":[95],"runs":[97],"in":[98],"NEXPTIME,":[99],"which":[100],"optimal":[102],"since":[103],"plain":[108],"C2is":[109],"NEXPTIME-complete.":[110]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2017018565","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":22},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4}],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2016-06-24T00:00:00"}
