Extending Two-Variable Logic on Trees. - Bartosz Bednarczyk; Witold Charatonik; Emanuel Kieronski (CSL, 2017)

Modulo Counting on Words and Trees. - Bartosz Bednarczyk; Witold Charatonik (FSTTCS, 2017)

Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints. - Franz Baader; Bartosz Bednarczyk; Sebastian Rudolph (Description Logics, 2019)

Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting. - Bartosz Bednarczyk; Sebastian Rudolph (IJCAI, 2019)

On the Complexity of Graded Modal Logics with Converse. - Bartosz Bednarczyk; Emanuel Kieronski; Piotr Witkowski 001 (JELIA, 2019)

Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? - Bartosz Bednarczyk; Stéphane Demri (LICS, 2019)

Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints. - Franz Baader; Bartosz Bednarczyk; Sebastian Rudolph (ECAI, 2020)

A Framework for Reasoning about Dynamic Axioms in Description Logics. - Bartosz Bednarczyk; Stéphane Demri; Alessio Mansutti (IJCAI, 2020)

All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. - Bartosz Bednarczyk; Robert Ferens; Piotr Ostropolski-Nalewaja (IJCAI, 2020)

Modal Logics with Composition on Finite Forests: Expressivity and Complexity. - Bartosz Bednarczyk; Stéphane Demri; Raul Fervari; Alessio Mansutti (LICS, 2020)

A Note on C² Interpreted over Finite Data-Words. - Bartosz Bednarczyk; Piotr Witkowski 001 (TIME, 2020)

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). - Bartosz Bednarczyk; Stéphane Demri; Raul Fervari; Alessio Mansutti (CoRR, 2020)

One-variable logic meets Presburger arithmetic. - Bartosz Bednarczyk (Theor. Comput. Sci., 2020)

Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract). - Bartosz Bednarczyk; Emanuel Kieronski (Description Logics, 2021)

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract). - Bartosz Bednarczyk; Sebastian Rudolph (Description Logics, 2021)

"Most of" leads to undecidability: Failure of adding frequencies to LTL. - Bartosz Bednarczyk; Jakub Michaliszyn (FoSSaCS, 2021)

On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. - Bartosz Bednarczyk; Maja Orlowska; Anna Pacanowska; Tony Tan (FSTTCS, 2021)

Exploiting Forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment. - Bartosz Bednarczyk (JELIA, 2021)

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? - Bartosz Bednarczyk; Stéphane Demri (CoRR, 2021)

Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics. - Bartosz Bednarczyk (CoRR, 2021)

Statistical EL is ExpTime-complete. - Bartosz Bednarczyk (Inf. Process. Lett., 2021)

Completing the Picture: Complexity of Graded Modal Logics with Converse. - Bartosz Bednarczyk; Emanuel Kieronski; Piotr Witkowski 001 (Theory Pract. Log. Program., 2021)

Finite Entailment of Local Queries in the Z Family of Description Logics. - Bartosz Bednarczyk; Emanuel Kieronski (AAAI, 2022)

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard. - Bartosz Bednarczyk; Sebastian Rudolph (AAAI, 2022)

Comonadic Semantics for Description Logics Games. - Bartosz Bednarczyk; Mateusz Urbanczyk (Description Logics, 2022)

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. - Bartosz Bednarczyk; Reijo Jaakkola (MFCS, 2022)

Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting. - Bartosz Bednarczyk; Oskar Fiuk (WoLLIC, 2022)

Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version). - Bartosz Bednarczyk; Reijo Jaakkola (CoRR, 2022)

Order-Invariance of Two-Variable Logic is coNExpTime-complete. - Bartosz Bednarczyk (CoRR, 2022)

Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? - Bartosz Bednarczyk; Stéphane Demri (Log. Methods Comput. Sci., 2022)

On the Limits of Decision: the Adjacent Fragment of First-Order Logic. - Bartosz Bednarczyk; Daumantas Kojelis; Ian Pratt-Hartmann (ICALP, 2023)

Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features. - Bartosz Bednarczyk (JELIA, 2023)

How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC. - Bartosz Bednarczyk; Sebastian Rudolph (J. Artif. Intell. Res., 2023)

On Composing Finite Forests with Modal Logics. - Bartosz Bednarczyk; Stéphane Demri; Raul Fervari; Alessio Mansutti (ACM Trans. Comput. Log., 2023)

Data Complexity in Expressive Description Logics With Path Expressions (Extended Abstract). - Bartosz Bednarczyk (Description Logics, 2024)

On the Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract). - Bartosz Bednarczyk; Daumantas Kojelis; Ian Pratt-Hartmann (Description Logics, 2024)

Data Complexity in Expressive Description Logics with Path Expressions. - Bartosz Bednarczyk (IJCAI, 2024)

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. - Bartosz Bednarczyk (Log. Methods Comput. Sci., 2024)

Database-Inspired Reasoning Problems in Description Logics With Path Expressions. - Bartosz Bednarczyk (2024)

About the Expressive Power and Complexity of Order-Invariance with Two Variables. - Bartosz Bednarczyk; Julien Grange (Log. Methods Comput. Sci., 2025)

The adjacent fragment and Quine's limits of decision. - Bartosz Bednarczyk; Daumantas Kojelis; Ian Pratt-Hartmann (J. Log. Comput., 2025)