Obserwuj
Bartosz Bednarczyk
Tytuł
Cytowane przez
Cytowane przez
Rok
Satisfiability and query answering in description logics with global and local cardinality constraints
F Baader, B Bednarczyk, S Rudolph
ECAI 2020 / DL 2019, 2020
16*2020
Why propositional quantification makes modal logics on trees robustly hard ?
B Bednarczyk, S Demri
LICS 2019, Preprint from LSV, 2019
132019
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
B Bednarczyk, S Rudolph
DL 2019 & IJCAI 2019, 2019
82019
Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
B Bednarczyk
Logics in Artificial Intelligence: 17th European Conference, JELIA 2021 …, 2021
72021
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
72020
Extending two-variable logic on trees
B Bednarczyk, W Charatonik, E Kieroński
CSL 2017, 2016
62016
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
B Bednarczyk, R Ferens, P Ostropolski-Nalewaja
32020
Completing the picture: Complexity of graded modal logics with converse
B Bednarczyk, E Kieroński, P Witkowski
Theory and Practice of Logic Programming 21 (4), 493-520, 2021
22021
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
22021
One-Variable Logic Meets Presburger Arithmetic
B Bednarczyk
Theoretical Computer Science, 2020
22020
On the Complexity of Graded Modal Logics with Converse
B Bednarczyk, E Kieroński, P Witkowski
JELIA 2019, 2018
22018
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting
B Bednarczyk, O Fiuk
Logic, Language, Information, and Computation: 28th International Workshop …, 2022
12022
Finite entailment of local queries in the Z family of description logics
B Bednarczyk, E Kieroński
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5487-5494, 2022
12022
Comonadic Semantics for Description Logics Games
B Bednarczyk, M Urbańczyk
DL 2022, 2022
12022
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics
B Bednarczyk
arXiv preprint arXiv:2108.05680, 2021
12021
“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
A Note on C² Interpreted over Finite Data-Words
B Bednarczyk, P Witkowski
27th International Symposium on Temporal Representation and Reasoning (TIME …, 2020
12020
Modulo counting on words and trees
B Bednarczyk, W Charatonik
FSTTCS 2017, 2017
12017
Order-Invariance of Two-Variable Logic is coNExpTime-complete
B Bednarczyk
arXiv preprint arXiv:2208.07577, 2022
2022
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
S Demri, B Bednarczyk
Logical Methods in Computer Science 18, 2022
2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20