Bartosz Bednarczyk
Bartosz Bednarczyk
Wissenschaftlicher Mitarbeiter Computational Logic
- bartosz.bednarczyk@tu-dresden.de
- +49 351 463 42665
- APB 2031
About Me
I am a PHD student and a researcher at TU Dresden and at University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining TU Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stéphane Demri.
My works focus on different aspects of ontology mediated data access and applications of decidable fragments of first-order logic (like existential rules or guarded-fragments) to database-inspired reasoning problems. More broadly, I'm interested in finite model theory. Since April 2019 I am employed in the ERC grant DeciGUT. Moreover, from September 2018 until September 2022 I was a principal investigator in my own Polish Ministry of Science and Higher Education grant titled "Logics with generalized counting quantifiers for data-aware processes and database systems".
One of my biggest passions is teaching. I actively contribute to an introductory logic course at the University of Wrocław (as a problem setter, organiser of exercise sessions, and supplementary lecturer). From time to time I also organise classes related to finite model theory (both in Wrocław and Dresden), so feel free to contact me if you are interested in doing some research projects (BSc/MSc/PHD) in related areas! At the beginning of 2022, I kick-started a teaching company and started teaching some classes in the XIV highschool in Wrocław.
Neueste Publikationen
Komplette Publikationsliste anzeigen
On Composing Finite Forests with Modal Logics
ACM Transactions on Computational Logic, to appear
Details
Comonadic Semantics for Description Logics Games
In Ofer Arieli, Martin Homola, Jean Christoph Jung, Marie-Laure Mugnier, eds., Proceedings of the 35th International Workshop on Description Logics (DL 2022), August 2022
Details Download
Towards Model Theory of Ordered Logics: Expressivity and Interpolation
In Stefan Szeider, Robert Ganian, Alexandra Silva, eds., Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), volume 241 of Leibniz International Proceedings in Informatics, 15:1--15:14, August 2022. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Details Download
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting
In Agata Ciabattoni, Elaine Pimentel, Ruy J. G. B. de Queiroz, eds., Proceedings of the 28th Workshop on Logic, Language, Information and Computation (WOLLIC 2022), volume 2022 of Logic, Language, Information, and Computation, 295--308, September 2022. Springer International Publishing
Details Download
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 5495-5502, February 2022
Details Download
Finite Entailment of Local Queries in the Z family of Description Logics
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), volume 36, 5487--5494, February 2022. AAAI Press
Details Download
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Logical Methods in Computer Science, Volume 18, Issue 3(5), July 2022
Details Download
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming, 21(4):493--520, April 2021
Details Download
Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
In Wolfgang Faber, Gerhard Friedrich, Martin Gebser, Michael Morak, eds., Proceedings of the 17th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2021), volume 12678 of Lecture Notes in Computer Science, 179--193, May 2021. Springer International Publishing
Details Download
"Most of" leads to undecidability: Failure of adding frequencies to LTL
In Stefan Kiefer, Christine Tasson, eds., Proceedings of the Foundations of Software Science and Computation Structures - 24th International Conference (FOSSACS 2021), volume 12650 of Lecture Notes in Computer Science, 82--101, March 2021. Springer
Details Download
Lehrveranstaltungen
- Finite and algorithmic model theory (22/23) (WS 2022)
- Finite and algorithmic model theory (SS 2021)
DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
