Michael Vanden Boom

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