Bartosz Bednarczyk

Available identifiers

zbMath Open bednarczyk.bartoszMaRDI QIDQ2007733

List of research outcomes

Publication	Date of Publication	Type
Why propositional quantification makes modal logics on trees robustly hard?	2024-12-19	Paper
On the limits of decision: the adjacent fragment of first-order logic	2024-11-14	Paper
Towards a model theory of ordered logics: expressivity and interpolation	2024-08-06	Paper
Exploring non-regular extensions of propositional dynamic logic with description-logics features	2024-06-27	Paper
Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features	2024-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q6187052	2024-02-05	Paper
How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)	2023-12-20	Paper
Completing the Picture: Complexity of Graded Modal Logics with Converse	2023-12-12	Paper
A Note on C² Interpreted over Finite Data-Words	2023-11-02	Paper
Presburger Büchi tree automata with applications to logics with expressive counting	2023-06-02	Paper
On Composing Finite Forests with Modal Logics	2023-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q5101338	2022-08-30	Paper
Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment	2021-12-01	Paper
``Most of leads to undecidability: failure of adding frequencies to LTL	2021-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4999259	2021-07-06	Paper
Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete	2021-06-16	Paper
Modal Logics with Composition on Finite Forests	2021-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q5136301	2020-11-25	Paper
Extending Two-Variable Logic on Trees	2020-05-26	Paper
On the complexity of graded modal logics with converse	2020-02-18	Paper
One-variable logic meets Presburger arithmetic	2019-11-22	Paper

Research outcomes over time

This page was built for person: Bartosz Bednarczyk