default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuel Kieronski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Oskar Fiuk, Emanuel Kieronski, Vincent Michielini:
On the Complexity of Maslov's Class K (Extended Abstract). Description Logics 2024- [c32]Oskar Fiuk
, Emanuel Kieronski, Vincent Michielini:
On the complexity of Maslov's class K. LICS 2024: 35:1-35:14 - [i12]Oskar Fiuk, Emanuel Kieronski:
Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic. CoRR abs/2404.03377 (2024) - [i11]Oskar Fiuk, Emanuel Kieronski, Vincent Michielini:
On the complexity of Maslov's class K. CoRR abs/2407.13339 (2024) - 2023
- [c31]Oskar Fiuk, Emanuel Kieronski:
An excursion to the border of decidability: between two- and three-variable logic. LPAR 2023: 205-223 - [c30]Emanuel Kieronski:
A Uniform One-Dimensional Fragment with Alternation of Quantifiers. GandALF 2023: 1-15 - 2022
- [j10]Emanuel Kieronski, Antti Kuusisto:
One-dimensional fragment over words and trees. J. Log. Comput. 32(5): 902-941 (2022) - [c29]Bartosz Bednarczyk, Emanuel Kieronski:
Finite Entailment of Local Queries in the Z Family of Description Logics. AAAI 2022: 5487-5494 - 2021
- [j9]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
Completing the Picture: Complexity of Graded Modal Logics with Converse. Theory Pract. Log. Program. 21(4): 493-520 (2021) - [c28]Bartosz Bednarczyk, Emanuel Kieronski:
Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract). Description Logics 2021 - [c27]Emanuel Kieronski, Sebastian Rudolph:
Finite Model Theory of the Triguarded Fragment and Related Logics (Extended Abstract). Description Logics 2021 - [c26]Emanuel Kieronski, Sebastian Rudolph:
Finite Model Theory of the Triguarded Fragment and Related Logics. LICS 2021: 1-13 - [i10]Emanuel Kieronski, Sebastian Rudolph:
Finite Model Theory of the Triguarded Fragment and Related Logics. CoRR abs/2101.08377 (2021) - [i9]Emanuel Kieronski, Antti Kuusisto:
One-Dimensional Fragment over Words and Trees. CoRR abs/2110.02678 (2021) - 2020
- [c25]Emanuel Kieronski, Adam Malinowski:
The Triguarded Fragment with Transitivity. LPAR 2020: 334-353
2010 – 2019
- 2019
- [c24]Daniel Danielski, Emanuel Kieronski:
Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract). Description Logics 2019 - [c23]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
On the Complexity of Graded Modal Logics with Converse. JELIA 2019: 642-658 - [c22]Emanuel Kieronski:
One-Dimensional Guarded Fragments. MFCS 2019: 16:1-16:14 - [c21]Daniel Danielski, Emanuel Kieronski:
Finite Satisfiability of Unary Negation Fragment with Transitivity. MFCS 2019: 17:1-17:15 - [i8]Emanuel Kieronski:
One-dimensional guarded fragments. CoRR abs/1904.04572 (2019) - 2018
- [j8]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Two-variable logics with counting and semantic constraints. ACM SIGLOG News 5(3): 22-43 (2018) - [j7]Emanuel Kieronski, Lidia Tendera:
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. ACM Trans. Comput. Log. 19(2): 8:1-8:34 (2018) - [c20]Daniel Danielski, Emanuel Kieronski:
Unary negation fragment with equivalence relations has the finite model property. LICS 2018: 285-294 - [i7]Daniel Danielski, Emanuel Kieronski:
Unary negation fragment with equivalence relations has the finite model property. CoRR abs/1802.01318 (2018) - [i6]Daniel Danielski, Emanuel Kieronski:
Finite Satisfiability of Unary Negation Fragment with Transitivity. CoRR abs/1809.03245 (2018) - [i5]Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski:
On the Complexity of Graded Modal Logics with Converse. CoRR abs/1812.04413 (2018) - 2017
- [j6]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Equivalence closure in the two-variable guarded fragment. J. Log. Comput. 27(4): 999-1021 (2017) - [c19]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CSL 2017: 11:1-11:20 - [c18]Emanuel Kieronski, Antti Kuusisto:
One-Dimensional Logic over Trees. MFCS 2017: 64:1-64:13 - 2016
- [j5]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32 (2016) - [c17]Emanuel Kieronski:
One-Dimensional Logic over Words. CSL 2016: 38:1-38:15 - [i4]Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. CoRR abs/1611.02112 (2016) - [i3]Emanuel Kieronski, Lidia Tendera:
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. CoRR abs/1611.03267 (2016) - 2015
- [j4]Jakub Michaliszyn, Jan Otop, Emanuel Kieronski:
On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. 17(1): 2 (2015) - [c16]Emanuel Kieronski, Antti Kuusisto:
Uniform One-Dimensional Fragments with One Equivalence Relation. CSL 2015: 597-615 - 2014
- [j3]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43(3): 1012-1063 (2014) - [c15]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Decidability of weak logics with deterministic transitive closure. CSL-LICS 2014: 29:1-29:10 - [c14]Emanuel Kieronski, Antti Kuusisto:
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. MFCS (1) 2014: 365-376 - [i2]Emanuel Kieronski, Antti Kuusisto:
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. CoRR abs/1409.0731 (2014) - 2013
- [c13]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [i1]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees. CoRR abs/1304.7204 (2013) - 2012
- [j2]Emanuel Kieronski, Martin Otto:
Small substructures and decidability issues for first-order logic with two variables. J. Symb. Log. 77(3): 729-765 (2012) - [c12]Jakub Michaliszyn, Emanuel Kieronski:
Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. Advances in Modal Logic 2012: 464-482 - [c11]Emanuel Kieronski, Jakub Michaliszyn:
Two-Variable Universal Logic with Transitive Closure. CSL 2012: 396-410 - [c10]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. LICS 2012: 431-440 - 2011
- [c9]Emanuel Kieronski:
Decidability Issues for Two-Variable Logics with Several Linear Orders. CSL 2011: 337-351 - [c8]Emanuel Kieronski, Jakub Michaliszyn, Jan Otop:
Modal Logics Definable by Universal Three-Variable Formulas. FSTTCS 2011: 264-275 - 2010
- [c7]Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski:
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) 2010: 357-368
2000 – 2009
- 2009
- [c6]Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. LICS 2009: 123-132 - 2007
- [c5]Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. LPAR 2007: 318-332 - 2006
- [j1]Emanuel Kieronski:
On the complexity of the two-variable guarded fragment with transitive guards. Inf. Comput. 204(11): 1663-1703 (2006) - 2005
- [c4]Emanuel Kieronski:
Results on the Guarded Fragment with Equivalence or Transitive Relations. CSL 2005: 309-324 - [c3]Emanuel Kieronski, Martin Otto:
Small Substructures and Decidability Issues for First-Order Logic with Two Variables. LICS 2005: 448-457 - 2003
- [c2]Emanuel Kieronski:
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard. FoSSaCS 2003: 299-312 - 2002
- [c1]Emanuel Kieronski:
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. STACS 2002: 608-619
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
