Skip to main content

Michael Vanden Boom

Publications

Characterizing Definability in Decidable Fixpoint Logics. [pdf]
Joint work with Michael Benedikt and Pierre Bourhis.
In ICALP 2017.
(Best Paper Award)

Effective Interpolation and Preservation in Guarded Logics. [link]
Joint work with Michael Benedikt and Balder ten Cate.
In ACM Transactions on Computational Logic 17(2): 8 (2016).
(Long version of CSL-LICS 2014 paper)

A Step Up in Expressiveness of Decidable Fixpoint Logics. [pdf] [link] [slides]
Joint work with Michael Benedikt and Pierre Bourhis.
In LICS 2016.

Query Answering with Transitive and Linear-Ordered Data. [pdf] [link] [slides] [poster]
Joint work with Antoine Amarilli, Michael Benedikt, and Pierre Bourhis.
In IJCAI 2016.

Interpolation with Decidable Fixpoint Logics. [pdf] [link] [slides]
Joint work with Michael Benedikt and Balder ten Cate.
In LICS 2015.

The Complexity of Boundedness for Guarded Logics. [pdf] [link] [slides]
Joint work with Michael Benedikt, Balder ten Cate, and Thomas Colcombet.
In LICS 2015.

Effective Interpolation and Preservation in Guarded Logics. [pdf] [link] [slides]
Joint work with Michael Benedikt and Balder ten Cate.
In CSL-LICS 2014.

Two-Way Cost Automata and Cost Logics over Infinite Trees. [pdf] [link] [slides]
Joint work with Achim Blumensath, Thomas Colcombet, Denis Kuperberg, and Pawel Parys.
In CSL-LICS 2014.

Deciding the weak definability of Buechi definable tree languages. [pdf] [link] [slides]
Joint work with Thomas Colcombet, Denis Kuperberg, Christof Löding.
In CSL 2013.

Weak Cost Automata over Infinite Trees. [pdf]
PhD Thesis, University of Oxford. October 2012.

On the Expressive Power of Cost Logics over Infinite Words. [pdf] [link] [slides]
Joint work with Denis Kuperberg.
In ICALP 2012.

Quasi-Weak Cost Automata: A New Variant of Weakness. [pdf] [link]
Joint work with Denis Kuperberg.
In FSTTCS 2011.

Weak Cost Monadic Logic over Infinite Trees. [pdf] [link] [slides]
In MFCS 2011.

The Effective Borel Hierarchy. [link]
In Fundamenta Mathematicae 195 (2007):269−289.

Turing Computable Embeddings. [link]
Joint work with Julia Knight and Sara Miller.
In Journal of Symbolic Logic 72 (2007):901−918.