| Why propositional quantification makes modal logics on trees robustly hard ? B Bednarczyk, S Demri LICS 2019, Preprint from LSV, 2019 | 9 | 2019 |
| 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 | 5 | 2020 |
| Extending two-variable logic on trees B Bednarczyk, W Charatonik, E Kieroński CSL 2017, 2016 | 5 | 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 | 4 | 2020 |
| 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 | 4 | 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 | 4 | 2019 |
| On the Complexity of Graded Modal Logics with Converse B Bednarczyk, E Kieroński, P Witkowski JELIA 2019, 2018 | 2 | 2018 |
| “Most of” leads to undecidability: Failure of adding frequencies to LTL B Bednarczyk, J Michaliszyn Foundations of Software Science and Computation Structures24th International …, 2021 | 1 | 2021 |
| Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment B Bednarczyk Logics in Artificial Intelligence: 17th European Conference, JELIA 2021 …, 2021 | 1 | 2021 |
| All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs B Bednarczyk, R Ferens, P Ostropolski-Nalewaja | 1 | 2020 |
| One-Variable Logic Meets Presburger Arithmetic B Bednarczyk Theoretical Computer Science, 2020 | 1 | 2020 |
| Modulo counting on words and trees B Bednarczyk, W Charatonik FSTTCS 2017, 2017 | 1 | 2017 |
| 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 |
Sebastian RudolphTechnische Universität DresdenZweryfikowany adres z tu-dresden.de
