| Two-variable first-order logic with equivalence closure E Kieronski, J Michaliszyn, I Pratt-Hartmann, L Tendera SIAM Journal on Computing 43 (3), 1012-1063, 2014 | 75 | 2014 |
| Small substructures and decidability issues for first-order logic with two variables E Kieronski, M Otto 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 448-457, 2005 | 54 | 2005 |
| On finite satisfiability of two-variable first-order logic with equivalence relations E Kieronski, L Tendera 2009 24th Annual IEEE Symposium on Logic In Computer Science, 123-132, 2009 | 53 | 2009 |
| Results on the guarded fragment with equivalence or transitive relations E Kieroński International Workshop on Computer Science Logic, 309-324, 2005 | 53 | 2005 |
| Complexity of two-variable logic on finite trees S Benaim, M Benedikt, W Charatonik, E Kieroński, R Lenhardt, ... ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016 | 34 | 2016 |
| Small substructures and decidability issues for first-order logic with two variables E Kieroński, M Otto The Journal of Symbolic Logic 77 (03), 729-765, 2012 | 33 | 2012 |
| Decidability Issues for Two-Variable Logics with Several Linear Orders E Kieronski Computer 12, 337-351, 0 | 33* | |
| The two-variable guarded fragment with transitive guards is 2EXPTIME-hard E Kieroński Foundations of Software Science and Computation Structures: 6th …, 2003 | 29 | 2003 |
| Complexity and expressivity of uniform one-dimensional fragment with equality E Kieroński, A Kuusisto International Symposium on Mathematical Foundations of Computer Science, 365-376, 2014 | 26 | 2014 |
| Finite satisfiability of unary negation fragment with transitivity D Danielski, E Kieronski arXiv preprint arXiv:1809.03245, 2018 | 20 | 2018 |
| On the complexity of the two-variable guarded fragment with transitive guards E Kieroński Information and Computation 204 (11), 1663-1703, 2006 | 18 | 2006 |
| On finite satisfiability of the guarded fragment with equivalence or transitive guards E Kieroński, L Tendera Logic for Programming, Artificial Intelligence, and Reasoning: 14th …, 2007 | 17 | 2007 |
| B and D are enough to make the Halpern–Shoham logic undecidable J Marcinkowski, J Michaliszyn, E Kieroński Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 16 | 2010 |
| Uniform one-dimensional fragments with one equivalence relation E Kieronski, A Kuusisto 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 597-615, 2015 | 14 | 2015 |
| Two-variable universal logic with transitive closure E Kieronski, J Michaliszyn Computer Science Logic (CSL'12)-26th International Workshop/21st Annual …, 2012 | 14 | 2012 |
| EXPSPACE-complete variant of guarded fragment with transitivity E Kieroński Annual Symposium on Theoretical Aspects of Computer Science, 608-619, 2002 | 14 | 2002 |
| Decidability of weak logics with deterministic transitive closure W Charatonik, E Kieroński, F Mazowiecki Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 13 | 2014 |
| Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants E Kieroński, L Tendera ACM Transactions on Computational Logic (TOCL) 19 (2), 1-34, 2018 | 11 | 2018 |
| Finite model theory of the triguarded fragment and related logics E Kieroński, S Rudolph 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021 | 10 | 2021 |
| Two-variable logics with counting and semantic constraints E Kieroński, I Pratt-Hartmann, L Tendera ACM SIGLOG News 5 (3), 22-43, 2018 | 9 | 2018 |
Jakub MichaliszynUniversity of WrocławAdresă de e-mail confirmată pe cs.uni.wroc.pl
