| 2025 | KR | Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards. | Bartosz Bednarczyk, Emanuel Kieronski |
| 2024 | IJCAI | Data Complexity in Expressive Description Logics with Path Expressions. | Bartosz Bednarczyk |
| 2023 | ICALP | On the Limits of Decision: the Adjacent Fragment of First-Order Logic. | Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann |
| 2023 | JELIA | Beyond | Bartosz Bednarczyk |
| 2022 | AAAI | Finite Entailment of Local Queries in the Z Family of Description Logics. | Bartosz Bednarczyk, Emanuel Kieronski |
| 2022 | AAAI | The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard. | Bartosz Bednarczyk, Sebastian Rudolph |
| 2022 | MFCS | Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. | Bartosz Bednarczyk, Reijo Jaakkola |
| 2022 | WoLLIC | Presburger Bchi Tree Automata with Applications to Logics with Expressive Counting. | Bartosz Bednarczyk, Oskar Fiuk |
| 2021 | FOSSACS | "Most of" leads to undecidability: Failure of adding frequencies to LTL. | Bartosz Bednarczyk, Jakub Michaliszyn |
| 2021 | JELIA | Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment. | Bartosz Bednarczyk |
| 2020 | ECAI | Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. | Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph |
| 2020 | IJCAI | A Framework for Reasoning about Dynamic Axioms in Description Logics. | Bartosz Bednarczyk, Stphane Demri, Alessio Mansutti |
| 2020 | IJCAI | All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. | Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja |
| 2020 | LICS | Modal Logics with Composition on Finite Forests: Expressivity and Complexity. | Bartosz Bednarczyk, Stphane Demri, Raul Fervari, Alessio Mansutti |
| 2020 | TIME | A Note on C² Interpreted over Finite Data-Words. | Bartosz Bednarczyk, Piotr Witkowski |
| 2019 | IJCAI | Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. | Bartosz Bednarczyk, Sebastian Rudolph |
| 2019 | JELIA | On the Complexity of Graded Modal Logics with Converse. | Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski |
| 2019 | LICS | Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? | Bartosz Bednarczyk, Stphane Demri |
| 2017 | CSL | Extending Two-Variable Logic on Trees. | Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski |