Michael Vanden Boom
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
5
Active years
2011–2017
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2017 | ICALP | Characterizing Definability in Decidable Fixpoint Logics. | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2016 | IJCAI | Query Answering with Transitive and Linear-Ordered Data. | Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2016 | LICS | A Step Up in Expressiveness of Decidable Fixpoint Logics. | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2015 | LICS | Interpolation with Decidable Fixpoint Logics. | Michael Benedikt, Balder ten Cate, Michael Vanden Boom |
| 2015 | LICS | The Complexity of Boundedness for Guarded Logics. | Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom |
| 2014 | CSL | Effective interpolation and preservation in guarded logics. | Michael Benedikt, Balder ten Cate, Michael Vanden Boom |
| 2014 | CSL | Two-way cost automata and cost logics over infinite trees. | Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom |
| 2013 | CSL | Deciding the weak definability of Bchi definable tree languages. | Thomas Colcombet, Denis Kuperberg, Christof Lding, Michael Vanden Boom |
| 2012 | ICALP | On the Expressive Power of Cost Logics over Infinite Words. | Denis Kuperberg, Michael Vanden Boom |
| 2011 | MFCS | Weak Cost Monadic Logic over Infinite Trees. | Michael Vanden Boom |