Bartosz Bednarczyk

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Bartosz Bednarczyk

Wissenschaftlicher MitarbeiterTechnische Universität DresdenInternational Center for Computational Logic Computational Logic

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. I am also a principal investigator in a 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! Recently, I also started a part-time job as a high school teacher at the 14th High School in Wrocław and kick-started a teaching company.

Neueste Publikationen

Komplette Publikationsliste anzeigen

Bartosz Bednarczyk, Oskar Fiuk
Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting
Technical Report, ICCL, May 2022. Technical Report
Details Download
Bartosz Bednarczyk, Emanuel Kieroński
Finite Entailment of Local Queries in the Z family of Description Logics
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), to appear
Details
Bartosz Bednarczyk, Sebastian Rudolph
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), to appear
Details Download
Bartosz Bednarczyk, Maja Orłowska, Anna Pacanowska, Tony Tan
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics
In Mikołaj Bojańczyk and Chandra Chekuri, eds., Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), volume 213, December 2021. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
Details Download
Bartosz Bednarczyk, Emanuel Kieroński
Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract)
In Martin Homola, Vladislav Ryzhikov, Renate A. Schmidt, eds., Proceedings of the 34th International Workshop on Description Logics (DL 2021), CEUR Workshop Proceedings, September 2021. CEUR-WS.org
Details Download
Bartosz Bednarczyk, Sebastian Rudolph
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract)
In Martin Homola, Vladislav Ryzhikov, Renate A. Schmidt, eds., Proceedings of the 34th International Workshop on Description Logics (DL 2021), CEUR Workshop Proceedings, September 2021. CEUR-WS.org
Details Download
Bartosz Bednarczyk
Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment
Proceedings of the 17th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2021), May 2021. Springer International Publishing
Details Download
Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL
Proceedings of the 24th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2021), March 2021
Details Download
Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming, April 2021
Details Download
Komplette Publikationsliste anzeigen

Lehrveranstaltungen

DeciGUT-logo-final.png

DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation