Bartosz Bednarczyk
Bartosz Bednarczyk
Wissenschaftlicher Mitarbeiter Computational Logic
- bartosz.bednarczyk@tu-dresden.de
- +49 351 463 42665
- APB 2031
About Me
Since April 2019, I am a PhD student at TU Dresden and at the University of Wrocław, supervised jointly by Sebastian Rudolph (Dresden) and Emanuel Kieroński (Wrocław). Before joining Dresden I studied "Parisian Master of Research in Computer Science" at ENS Paris-Saclay, under the supervision of Stephane Demri.
My work 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. My research is rather theoretical in nature: I find it useless from a practical point of view but nevertheless mathematically beautiful.
I have plenty of bachelor/master thesis topics and research projects ideas for ambitious students (related to model theory and decidable logics), so feel free to send me an email if you are interested. All the topics require some taste of theoretical computer science and logic, so it would be nice if you completed the "advanced logic" course or/and "description logics" course.
Neueste Publikationen
Komplette Publikationsliste anzeigen
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
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
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
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics
Technical Report, arXiv.org, August 2021. Technical Report
Details Download
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
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
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
"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
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming, April 2021
Details Download
Statistical EL is ExpTime-complete
Information Processing Letters, 169C(106113), August 2021
Details Download
Lehrveranstaltungen
- Finite and algorithmic model theory (SS 2021)
DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
