Satisfiability and query answering in description logics with global and local cardinality constraints F Baader, B Bednarczyk, S Rudolph
ECAI 2020 / DL 2019, 2020
24 * 2020 Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting B Bednarczyk, S Rudolph
DL 2019 & IJCAI 2019, 2019
15 2019 Why propositional quantification makes modal logics on trees robustly hard ? B Bednarczyk, S Demri
LICS 2019, Preprint from LSV, 2019
14 2019 Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment B Bednarczyk
Logics in Artificial Intelligence: 17th European Conference, JELIA 2021 …, 2021
13 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
9 2021 Extending two-variable logic on trees B Bednarczyk, W Charatonik, E Kieroński
CSL 2017, 2016
9 2016 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
8 2020 Towards a model theory of ordered logics: Expressivity and interpolation B Bednarczyk, R Jaakkola
International Symposium on Mathematical Foundations of Computer Science …, 2022
6 2022 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
6 2022 On the limits of decision: the adjacent fragment of first-order logic B Bednarczyk, D Kojelis, I Pratt-Hartmann
arXiv preprint arXiv:2305.03133, 2023
5 2023 Presburger Büchi tree automata with applications to logics with expressive counting B Bednarczyk, O Fiuk
International Workshop on Logic, Language, Information, and Computation, 295-308, 2022
5 2022 One-Variable Logic Meets Presburger Arithmetic B Bednarczyk
Theoretical Computer Science, 2020
5 2020 Comonadic Semantics for Description Logics Games. B Bednarczyk, M Urbanczyk, O Arieli, M Homola, JC Jung, M Mugnier
Description Logics, 2022
4 2022 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
4 2021 How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC B Bednarczyk, S Rudolph
Journal of Artificial Intelligence Research 78, 385–458-385–458, 2023
3 2023 The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard B Bednarczyk, S Rudolph
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5495-5502, 2022
3 2022 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
3 2021 All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs B Bednarczyk, R Ferens, P Ostropolski-Nalewaja
3 2020 On the Complexity of Graded Modal Logics with Converse B Bednarczyk, E Kieroński, P Witkowski
JELIA 2019, 2018
3 2018 Beyond B Bednarczyk
European Conference on Logics in Artificial Intelligence, 289-305, 2023
2 2023 
Sebastian RudolphTechnische Universität Dresden and ScaDS.AIZweryfikowany adres z tu-dresden.de
