Emanuel Kieronski

According to our database, Emanuel Kieronski authored at least 39 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

A Uniform One-Dimensional Fragment with Alternation of Quantifiers.

Emanuel Kieronski

Proceedings of the Fourteenth International Symposium on Games, 2023

An excursion to the border of decidability: between two- and three-variable logic.

Oskar Fiuk, Emanuel Kieronski

Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

2022

One-dimensional fragment over words and trees.

Emanuel Kieronski, Antti Kuusisto

J. Log. Comput., 2022

Finite Entailment of Local Queries in the Z Family of Description Logics.

Bartosz Bednarczyk, Emanuel Kieronski

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Completing the Picture: Complexity of Graded Modal Logics with Converse.

Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski

Theory Pract. Log. Program., 2021

Finite Model Theory of the Triguarded Fragment and Related Logics.

Emanuel Kieronski, Sebastian Rudolph

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Finite Model Theory of the Triguarded Fragment and Related Logics (Extended Abstract).

Emanuel Kieronski, Sebastian Rudolph

Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract).

Bartosz Bednarczyk, Emanuel Kieronski

Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020

The Triguarded Fragment with Transitivity.

Emanuel Kieronski, Adam Malinowski

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

One-Dimensional Guarded Fragments.

Emanuel Kieronski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Finite Satisfiability of Unary Negation Fragment with Transitivity.

Daniel Danielski, Emanuel Kieronski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

On the Complexity of Graded Modal Logics with Converse.

Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract).

Daniel Danielski, Emanuel Kieronski

Proceedings of the 32nd International Workshop on Description Logics, 2019

2018

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants.

Emanuel Kieronski, Lidia Tendera

ACM Trans. Comput. Log., 2018

Two-variable logics with counting and semantic constraints.

Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera

ACM SIGLOG News, 2018

Unary negation fragment with equivalence relations has the finite model property.

Daniel Danielski, Emanuel Kieronski

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Equivalence closure in the two-variable guarded fragment.

Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera

J. Log. Comput., 2017

One-Dimensional Logic over Trees.

Emanuel Kieronski, Antti Kuusisto

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Extending Two-Variable Logic on Trees.

Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Complexity of Two-Variable Logic on Finite Trees.

Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell

ACM Trans. Comput. Log., 2016

One-Dimensional Logic over Words.

Emanuel Kieronski

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

On the Decidability of Elementary Modal Logics.

Jakub Michaliszyn, Jan Otop, Emanuel Kieronski

ACM Trans. Comput. Log., 2015

Uniform One-Dimensional Fragments with One Equivalence Relation.

Emanuel Kieronski, Antti Kuusisto

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Two-Variable First-Order Logic with Equivalence Closure.

Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera

SIAM J. Comput., 2014

Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality.

Emanuel Kieronski, Antti Kuusisto

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Decidability of weak logics with deterministic transitive closure.

Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees

Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki

CoRR, 2013

2012

Small substructures and decidability issues for first-order logic with two variables.

Emanuel Kieronski, Martin Otto

J. Symb. Log., 2012

Two-Variable Universal Logic with Transitive Closure.

Emanuel Kieronski, Jakub Michaliszyn

Proceedings of the Computer Science Logic (CSL'12), 2012

Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames.

Jakub Michaliszyn, Emanuel Kieronski

Proceedings of the Advances in Modal Logic 9, 2012

2011

Modal Logics Definable by Universal Three-Variable Formulas.

Emanuel Kieronski, Jakub Michaliszyn, Jan Otop

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Decidability Issues for Two-Variable Logics with Several Linear Orders.

Emanuel Kieronski

Proceedings of the Computer Science Logic, 2011

2010

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable.

Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations.

Emanuel Kieronski, Lidia Tendera

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2007

On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.

Emanuel Kieronski, Lidia Tendera

Proceedings of the Logic for Programming, 2007

2006

On the complexity of the two-variable guarded fragment with transitive guards.

Emanuel Kieronski

Inf. Comput., 2006

2005

Results on the Guarded Fragment with Equivalence or Transitive Relations.

Emanuel Kieronski

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003

The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard.

Emanuel Kieronski

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

EXPSPACE-Complete Variant of Guarded Fragment with Transitivity.

Emanuel Kieronski

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002