Bartosz Jan Bednarczyk

Senior postdoc at TU Wien · Assistant professor at the University of Wrocław

I lead the FWF project FINGO at TU Wien and am an assistant professor at the University of Wrocław (currently on a 20% workload). Before taking up my full-time position in Wrocław, I defended my PhD thesis at TU Dresden under the main supervision of Sebastian Rudolph; before that, I studied in the Parisian Master of Research in Computer Science at ENS Paris-Saclay under the supervision of Stéphane Demri.

I am a logician working in applied dendrology. Most of my current research concerns the use of trees, cacti and flowers in finite-model reasoning for dynamic logics (extensions of PDL, the modal μ-calculus, and more). More broadly, I am interested in finite model theory and the theory of computation.

Bartosz Bednarczyk greeting a very fluffy white dog

Latest news

  • New paper with Mikołaj Swoboda, Towards Finite Satisfiability of PDL with Loops, is now on arXiv (under submission). We show that finite satisfiability is ExpTime-complete for LoopPDL (also with converse) when every negated non-atomic loop has the form loop(π+). It is part of our ongoing work on LoopPDL: we are close to settling the finite satisfiability problem for full LoopPDL and plan to announce the complete result by the end of 2026.

  • The new version of this page is finally out.

  • Until the end of February 2027, I am declining all reviewing invitations. Sorry! Over the last two years I reviewed at least four times as many papers as I published, so it seems fair to spend the next few months on actual research.

  • Mikołaj Swoboda is now officially my PhD student. One of my biggest achievements so far :)

  • I am happy to announce that Ian Pratt-Hartmann and I will give a five-day course on decidable fragments of first-order logic at ESSLLI 2026, the 37th European Summer School in Logic, Language and Information. Course page and slides.

  • I was awarded a three-year FWF ESPRIT grant in Vienna for my project FINGO: Finite Graph Operating Automata Meet Dynamic Logics, expected to start on 1 April 2026. The project investigates the finite satisfiability problem for extensions of dynamic logics, such as PDL and the μ-calculus. A short project summary is available here. Feel free to contact me if you are interested in collaborating!

  • I successfully co-organized DL Workshop 2025 in Opole and was elected to the DL Workshop Steering Committee.

Contact

E-mail

  • bartek at cs.uni.wroc.plwork, preferred
  • bartosz.bednarczyk at tuwien.ac.atwork'
  • bartosz.jan.bednarczyk at gmail dot comprivate

Visiting addresses

TU Wien Informatics
Room HE0340
Favoritenstraße 9–11, 1040 Vienna, Austria
Instytut Informatyki Uniwersytetu Wrocławskiego
Room 324 (3rd floor)
Fryderyka Joliot-Curie 15, 50-383 Wrocław, Poland
Larger map

Recent papers

All publications
  • DL 2026

    Baby Steps Towards Finite Satisfiability for LoopPDL

    Bartosz Bednarczyk, Mikołaj Swoboda

    PDFPublisher
  • DL 2026

    A Horn Extension of DL-Lite with NL Data Complexity

    Janos Arpasi, Bartosz Bednarczyk, Magdalena Ortiz

    PDFPublisher
  • KR 2025

    Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards

    Bartosz Bednarczyk, Emanuel Kieroński

    PDFDOI
  • JLC 2025

    The Adjacent Fragment and Quine’s Limits of Decision

    Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann

    PDFDOI

For the past two years I held a teaching-heavy position and spent much of my time reviewing papers. Since FINGO started in April 2026, I have been fully active in research again.