E-LIB Suche - Ergebnisse für: Kieronski, Emanuel

1

Database-Inspired Reasoning Problems in Description Logics ..:

, 2024

Link: https://nbn-resolving.or..

2

On the complexity of Maslov's class K̅:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Fiuk, Oskar ; Kieronski, Emanuel ; Michielini, Vincent - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

3

One-dimensional fragment over words and trees:

Kieroński, Emanuel ; Kuusisto, Antti
Journal of Logic and Computation. 32 (2022) 5 - p. 902-941 , 2022

Link: https://doi.org/10.1093/..

4

Completing the Picture: Complexity of Graded Modal Logics w..:

BEDNARCZYK, BARTOSZ ; KIEROŃSKI, EMANUEL ; WITKOWSKI, PIOTR
Theory and Practice of Logic Programming. 21 (2021) 4 - p. 493-520 , 2021

Link: https://doi.org/10.1017/..

5

Finite model theory of the triguarded fragment and related ..:

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

Kieroński, Emanuel ; Rudolph, Sebastian - p. 1-13 , 2021

Link: https://dl.acm.org/doi/1..

6

On the Complexity of Graded Modal Logics with Converse:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,

Bednarczyk, Bartosz ; Kieroński, Emanuel ; Witkowski, Piotr - p. 642-658 , 2019

Link: https://doi.org/10.1007/..

7

Finite Satisfiability of the Two-Variable Guarded Fragment ..:

Kieroński, Emanuel ; Tendera, Lidia
ACM Transactions on Computational Logic (TOCL). 19 (2018) 2 - p. 1-34 , 2018

Link: https://dl.acm.org/doi/1..

8

Two-variable logics with counting and semantic constraints:

Kieroński, Emanuel ; Pratt-Hartmann, Ian ; Tendera, Lidia
ACM SIGLOG News. 5 (2018) 3 - p. 22-43 , 2018

Link: https://doi.org/10.1145/..

9

Finite Satisfiability of the Two-Variable Guarded Fragment ..:

Kieroński, Emanuel ; Tendera, Lidia
ACM Transactions on Computational Logic. 19 (2018) 2 - p. 1-34 , 2018

Link: https://doi.org/10.1145/..

10

Two-variable logics with counting and semantic constraints:

Kieroński, Emanuel ; Pratt-Hartmann, Ian ; Tendera, Lidia
ACM SIGLOG News. 5 (2018) 3 - p. 22-43 , 2018

Link: https://dl.acm.org/doi/1..

11

Unary negation fragment with equivalence relations has the ..:

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

Danielski, Daniel ; Kieroński, Emanuel - p. 285-294 , 2018

Link: https://dl.acm.org/doi/1..

12

One-dimensional logic over trees:

, In: 42nd International Symposium on Mathematical Foundations of Computer Science / edited by Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin

Kieroński, Emanuel ; Kuusisto, Antti. (2017)

Link: http://dx.doi.org/10.423..

13

Complexity of Two-Variable Logic on Finite Trees:

Benaim, Saguy ; Benedikt, Michael ; Charatonik, Witold...
ACM Transactions on Computational Logic (TOCL). 17 (2016) 4 - p. 1-38 , 2016

Link: https://dl.acm.org/doi/1..

14

Complexity of Two-Variable Logic on Finite Trees:

Benaim, Saguy ; Benedikt, Michael ; Charatonik, Witold...
ACM Transactions on Computational Logic. 17 (2016) 4 - p. 1-38 , 2016

Link: https://doi.org/10.1145/..

15

On the Decidability of Elementary Modal Logics:

Michaliszyn, Jakub ; Otop, Jan ; Kieroński, Emanuel
ACM Transactions on Computational Logic (TOCL). 17 (2015) 1 - p. 1-47 , 2015

Link: https://dl.acm.org/doi/1..