Turing computable embeddings. - Julia F. Knight; Sara Miller; Michael Vanden Boom (J. Symb. Log., 2007)

Quasi-Weak Cost Automata: A New Variant of Weakness. - Denis Kuperberg; Michael Vanden Boom (FSTTCS, 2011)

Weak Cost Monadic Logic over Infinite Trees. - Michael Vanden Boom (MFCS, 2011)

On the Expressive Power of Cost Logics over Infinite Words. - Denis Kuperberg; Michael Vanden Boom (ICALP (2), 2012)

Weak cost automata over infinite trees. - Michael Vanden Boom (2012)

Deciding the weak definability of Büchi definable tree languages. - Thomas Colcombet; Denis Kuperberg; Christof Löding; Michael Vanden Boom (CSL, 2013)

Two-way cost automata and cost logics over infinite trees. - Achim Blumensath; Thomas Colcombet; Denis Kuperberg; Pawel Parys; Michael Vanden Boom (CSL-LICS, 2014)

Interpolation with Decidable Fixpoint Logics. - Michael Benedikt; Balder ten Cate; Michael Vanden Boom (LICS, 2015)

The Complexity of Boundedness for Guarded Logics. - Michael Benedikt; Balder ten Cate; Thomas Colcombet; Michael Vanden Boom (LICS, 2015)

A Step Up in Expressiveness of Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (LICS, 2016)

Effective Interpolation and Preservation in Guarded Logics. - Michael Benedikt; Balder ten Cate; Michael Vanden Boom (ACM Trans. Comput. Log., 2016)

Characterizing Definability in Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (ICALP, 2017)

Query Answering with Transitive and Linear-Ordered Data. - Antoine Amarilli; Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (J. Artif. Intell. Res., 2018)

Definability and Interpolation within Decidable Fixpoint Logics. - Michael Benedikt; Pierre Bourhis; Michael Vanden Boom (Log. Methods Comput. Sci., 2019)

Inference from Visible Information and Background Knowledge. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis; Michael Vanden Boom (ACM Trans. Comput. Log., 2021)