Emanuel Kieronski
Emanuel Kieronski
Institute of Computer Science, University of Wroclaw
Dirección de correo verificada de cs.uni.wroc.pl
Título
Citado por
Citado por
Año
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
582014
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
512005
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
452009
Results on the guarded fragment with equivalence or transitive relations
E Kieroński
International Workshop on Computer Science Logic, 309-324, 2005
352005
Decidability Issues for Two-Variable Logics with Several Linear Orders
E Kieronski
Computer 12, 337-351, 0
28*
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
272016
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
E Kieroński
International Conference on Foundations of Software Science and Computation …, 2003
252003
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
222012
On finite satisfiability of the guarded fragment with equivalence or transitive guards
E Kieroński, L Tendera
International Conference on Logic for Programming Artificial Intelligence …, 2007
172007
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
152014
Two-variable universal logic with transitive closure
E Kieronski, J Michaliszyn
Computer Science Logic (CSL'12)-26th International Workshop/21st Annual …, 2012
132012
B and D are enough to make the Halpern–Shoham logic undecidable
J Marcinkowski, J Michaliszyn, E Kieroński
International Colloquium on Automata, Languages, and Programming, 357-368, 2010
132010
On the complexity of the two-variable guarded fragment with transitive guards
E Kieroński
Information and Computation 204 (11), 1663-1703, 2006
132006
EXPSPACE-complete variant of guarded fragment with transitivity
E Kieroński
Annual Symposium on Theoretical Aspects of Computer Science, 608-619, 2002
122002
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
112014
Modal Logics Definable by Universal Three-Variable Formulas
E Kieronski, J Michaliszyn, J Otop
IARCS Annual Conference on Foundations of Software Technology and …, 2011
92011
Equivalence closure in the two-variable guarded fragment
E Kieroński, I Pratt-Hartmann, L Tendera
Journal of Logic and Computation 27 (4), 999-1021, 2017
72017
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
62018
Uniform one-dimensional fragments with one equivalence relation
E Kieronski, A Kuusisto
24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015
62015
Satisfiability of the two-variable fragment of first-order logic over trees
W Charatonik, E Kieroński, F Mazowiecki
arXiv preprint arXiv:1304.7204, 2013
62013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20