Bartosz Bednarczyk
Tytuł
Cytowane przez
Cytowane przez
Rok
Why propositional quantification makes modal logics on trees robustly hard ?
B Bednarczyk, S Demri
LICS 2019, Preprint from LSV, 2019
52019
Extending two-variable logic on trees
B Bednarczyk, W Charatonik, E Kieroński
CSL 2017, 2016
52016
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
F Baader, B Bednarczyk, S Rudolph
DL 2019 + ECAI 2020, 2019
3*2019
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
B Bednarczyk, S Rudolph
DL 2019 & IJCAI 2019, 2019
22019
On the Complexity of Graded Modal Logics with Converse
B Bednarczyk, E Kieroński, P Witkowski
JELIA 2019, 2018
12018
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
B Bednarczyk, S Demri, R Fervari, A Mansutti
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
2020
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
F Baader, B Bednarczyk, S Rudolph
arXiv preprint arXiv:2002.06072, 2020
2020
One-Variable Logic Meets Presburger Arithmetic
B Bednarczyk
Theoretical Computer Science, 2020
2020
Statistical EL is ExpTime-complete
B Bednarczyk
arXiv preprint arXiv:1911.00696, 2019
2019
Modulo counting on words and trees
B Bednarczyk, W Charatonik
FSTTCS 2017, 2017
2017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–10