Obserwuj
Emanuel Kieronski
Emanuel Kieronski
Institute of Computer Science, University of Wroclaw
Zweryfikowany adres z cs.uni.wroc.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
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
752014
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
562005
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
532009
Results on the guarded fragment with equivalence or transitive relations
E Kieroński
International Workshop on Computer Science Logic, 309-324, 2005
502005
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
342016
Decidability Issues for Two-Variable Logics with Several Linear Orders
E Kieronski
Computer 12, 337-351, 0
33*
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
322012
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
E Kieroński
Foundations of Software Science and Computation Structures: 6th …, 2003
282003
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
252014
On the complexity of the two-variable guarded fragment with transitive guards
E Kieroński
Information and Computation 204 (11), 1663-1703, 2006
182006
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
172007
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
162010
Finite satisfiability of unary negation fragment with transitivity
D Danielski, E Kieronski
arXiv preprint arXiv:1809.03245, 2018
152018
Uniform one-dimensional fragments with one equivalence relation
E Kieronski, A Kuusisto
24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015
142015
Two-variable universal logic with transitive closure
E Kieronski, J Michaliszyn
Computer Science Logic (CSL'12)-26th International Workshop/21st Annual …, 2012
142012
EXPSPACE-complete variant of guarded fragment with transitivity
E Kieroński
Annual Symposium on Theoretical Aspects of Computer Science, 608-619, 2002
132002
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
122014
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
112018
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
102021
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
92017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20