{"id":"https://openalex.org/W3029664024","doi":"https://doi.org/10.29007/z359","title":"The Triguarded Fragment with Transitivity","display_name":"The Triguarded Fragment with Transitivity","publication_year":2020,"publication_date":"2020-05-27","ids":{"openalex":"https://openalex.org/W3029664024","doi":"https://doi.org/10.29007/z359","mag":"3029664024"},"language":"en","primary_location":{"id":"doi:10.29007/z359","is_oa":true,"landing_page_url":"https://doi.org/10.29007/z359","pdf_url":"https://easychair.org/publications/open/3r7V","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/3r7V","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090488658","display_name":"Emanuel Kiero\u0144ski","orcid":"https://orcid.org/0000-0002-8538-8221"},"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":true,"raw_author_name":"Emanuel Kieronski","raw_affiliation_strings":["University of Wroc law, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc law, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041224284","display_name":"Adam Malinowski","orcid":"https://orcid.org/0000-0002-9382-9277"},"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,"raw_author_name":"Adam Malinowski","raw_affiliation_strings":["University of Wroc law, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc law, Poland","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090488658"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":0.3977,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67711511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":"73","issue":null,"first_page":"334","last_page":"313"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.989799976348877,"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/T10126","display_name":"Logic, programming, and type systems","score":0.989799976348877,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.988099992275238,"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/T10142","display_name":"Formal Methods in Verification","score":0.9685999751091003,"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/fragment","display_name":"Fragment (logic)","score":0.9087264537811279},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8689504265785217},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8353382349014282},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7206363677978516},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5870962738990784},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.554290235042572},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5137796998023987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46073099970817566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4426485002040863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43549424409866333},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.42856594920158386},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2535296678543091},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24514061212539673},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.21482506394386292},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21162372827529907},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.20647013187408447}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.9087264537811279},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8689504265785217},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8353382349014282},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7206363677978516},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5870962738990784},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.554290235042572},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5137796998023987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46073099970817566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4426485002040863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43549424409866333},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.42856594920158386},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2535296678543091},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24514061212539673},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.21482506394386292},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21162372827529907},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.20647013187408447}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/z359","is_oa":true,"landing_page_url":"https://doi.org/10.29007/z359","pdf_url":"https://easychair.org/publications/open/3r7V","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/z359","is_oa":true,"landing_page_url":"https://doi.org/10.29007/z359","pdf_url":"https://easychair.org/publications/open/3r7V","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3029664024.pdf","grobid_xml":"https://content.openalex.org/works/W3029664024.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1483892218","https://openalex.org/W1532158393","https://openalex.org/W1536964483","https://openalex.org/W1570923164","https://openalex.org/W1580817032","https://openalex.org/W1607294421","https://openalex.org/W1640599491","https://openalex.org/W1824207140","https://openalex.org/W1991981864","https://openalex.org/W2030359223","https://openalex.org/W2047674711","https://openalex.org/W2080220005","https://openalex.org/W2124580444","https://openalex.org/W2740094155","https://openalex.org/W2908208955","https://openalex.org/W6822517396"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W1506334254","https://openalex.org/W4377031836"],"abstract_inverted_index":{"The":[0],"triguarded":[1,167],"fragment":[2,12,37,70],"of":[3,9,53,66,102,112],"first-order":[4],"logic":[5],"is":[6,45,60,94,101],"an":[7,64],"extension":[8,65],"the":[10,35,39,51,67,87,91,103,108,113,129],"guarded":[11,36,69,115,147],"in":[13,50,119,141],"which":[14],"quantification":[15],"for":[16,90,107,128],"subformulas":[17],"with":[18],"at":[19],"most":[20],"two":[21,31],"free":[22],"variables":[23],"need":[24],"not":[25],"be":[26,48,79,150],"guarded.":[27],"Thus,":[28],"it":[29,100],"unifies":[30],"prominent":[32],"decidable":[33,57,95],"logics:":[34],"and":[38,96],"two-variable":[40],"fragment.":[41,116],"Its":[42],"satisfiability":[43,88,121],"problem":[44,89],"known":[46,155],"to":[47,78,152,160],"undecidable":[49],"presence":[52],"equality,":[54],"but":[55],"becomes":[56],"when":[58],"equality":[59,72],"forbidden.":[61],"We":[62,84,134],"consider":[63],"tri-":[68],"without":[71],"by":[73],"transitive":[74],"relations,":[75],"allowing":[76],"them":[77],"used":[80,151],"only":[81],"as":[82,106,131,157,159],"guards.":[83],"show":[85,136],"that":[86,98],"obtained":[92],"formalism":[93],"2-ExpTime-complete,":[97],"is,":[99],"same":[104],"complexity":[105],"analogous":[109],"exten-":[110],"sion":[111],"classical":[114],"In":[117],"fact,":[118],"our":[120,138],"test":[122],"we":[123],"use":[124],"a":[125,132],"decision":[126],"procedure":[127],"latter":[130],"subroutine.":[133],"also":[135],"how":[137],"approach,":[139],"consisting":[140],"exploiting":[142],"some":[143,154,162],"existing":[144],"results":[145,165],"on":[146,166],"logics,":[148],"can":[149],"reprove":[153],"facts,":[156],"well":[158],"derive":[161],"other":[163],"new":[164],"logics.":[168]},"counts_by_year":[{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}