Michael Vanden Boom

According to our database, Michael Vanden Boom authored at least 15 papers between 2007 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Inference from Visible Information and Background Knowledge.

Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom

ACM Trans. Comput. Log., 2021

2019

Definability and Interpolation within Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

Log. Methods Comput. Sci., 2019

2018

Query Answering with Transitive and Linear-Ordered Data.

Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

J. Artif. Intell. Res., 2018

2017

Characterizing Definability in Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Effective Interpolation and Preservation in Guarded Logics.

Michael Benedikt, Balder ten Cate, Michael Vanden Boom

ACM Trans. Comput. Log., 2016

A Step Up in Expressiveness of Decidable Fixpoint Logics.

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

The Complexity of Boundedness for Guarded Logics.

Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Interpolation with Decidable Fixpoint Logics.

Michael Benedikt, Balder ten Cate, Michael Vanden Boom

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Two-way cost automata and cost logics over infinite trees.

Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Deciding the weak definability of Büchi definable tree languages.

Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Weak cost automata over infinite trees.

Michael Vanden Boom

PhD thesis, 2012

On the Expressive Power of Cost Logics over Infinite Words.

Denis Kuperberg, Michael Vanden Boom

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Weak Cost Monadic Logic over Infinite Trees.

Michael Vanden Boom

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Quasi-Weak Cost Automata: A New Variant of Weakness.

Denis Kuperberg, Michael Vanden Boom

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2007

Turing computable embeddings.

Julia F. Knight, Sara Miller, Michael Vanden Boom

J. Symb. Log., 2007