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
92019
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
52020
Extending two-variable logic on trees
B Bednarczyk, W Charatonik, E Kieroński
CSL 2017, 2016
52016
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
B Bednarczyk, S Demri, R Fervari, A Mansutti
Lics 2020, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020
42020
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
42019
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
B Bednarczyk, S Rudolph
DL 2019 & IJCAI 2019, 2019
42019
On the Complexity of Graded Modal Logics with Converse
B Bednarczyk, E Kieroński, P Witkowski
JELIA 2019, 2018
22018
“Most of” leads to undecidability: Failure of adding frequencies to LTL
B Bednarczyk, J Michaliszyn
Foundations of Software Science and Computation Structures24th International …, 2021
12021
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
B Bednarczyk
Logics in Artificial Intelligence: 17th European Conference, JELIA 2021 …, 2021
12021
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
B Bednarczyk, R Ferens, P Ostropolski-Nalewaja
12020
One-Variable Logic Meets Presburger Arithmetic
B Bednarczyk
Theoretical Computer Science, 2020
12020
Modulo counting on words and trees
B Bednarczyk, W Charatonik
FSTTCS 2017, 2017
12017
Statistical EL is ExpTime-complete
B Bednarczyk
Information Processing Letters 169, 106113, 2021
2021
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
B Bednarczyk, S Rudolph
arXiv preprint arXiv:2106.15150, 2021
2021
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics
B Bednarczyk, M Orłowska, A Pacanowska, T Tan
arXiv preprint arXiv:2106.15250, 2021
2021
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?
B Bednarczyk, S Demri
arXiv preprint arXiv:2104.13122, 2021
2021
A Note on C² Interpreted over Finite Data-Words
B Bednarczyk, P Witkowski
27th International Symposium on Temporal Representation and Reasoning (TIME …, 2020
2020
A Framework for Reasoning about Dynamic Axioms in Description Logics
B Bednarczyk, S Demri, A Mansutti
2020
Completing the Picture: Complexity of Graded Modal Logics with Converse
B Bednarczyk, E Kieroński, P Witkowski
Theory and Practice of Logic Programming, 1-28, 2018
2018
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–19