Michael Vanden Boom

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 10

Top Venues

LICS

CoRR

CSL-LICS

ACM Trans. Comput. Log.

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2022)
Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom
Inference from Visible Information and Background Knowledge. ACM Trans. Comput. Log. 22 (2) (2021)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15 (3) (2019)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63 (2018)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. CoRR (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Characterizing Definability in Decidable Fixpoint Logics. ICALP (2017)
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. IJCAI (2016)
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
Query Answering with Transitive and Linear-Ordered Data. CoRR (2016)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17 (2) (2016)
Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom
The Complexity of Boundedness for Guarded Logics. LICS (2015)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Interpolation with Decidable Fixpoint Logics. LICS (2015)
Michael Benedikt, Balder ten Cate, Michael Vanden Boom
Effective interpolation and preservation in guarded logics. CSL-LICS (2014)
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
Two-way cost automata and cost logics over infinite trees. CSL-LICS (2014)
Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
Deciding the weak definability of Büchi definable tree languages. CSL (2013)
Denis Kuperberg, Michael Vanden Boom
On the Expressive Power of Cost Logics over Infinite Words. ICALP (2) (2012)
Michael Vanden Boom
Weak Cost Monadic Logic over Infinite Trees. MFCS (2011)
Denis Kuperberg, Michael Vanden Boom
Quasi-Weak Cost Automata: A New Variant of Weakness. FSTTCS (2011)
Julia F. Knight, Sara Miller, Michael Vanden Boom
Turing computable embeddings. J. Symb. Log. 72 (3) (2007)

Michael Vanden Boom.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Vanden Boom