Michael Vanden Boom
From MaRDI portal
Person:2911612
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Characterizing definability in decidable fixpoint logics | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7104937 (Why is no real title available?) (available as arXiv preprint) | 2019-09-13 | Paper |
| Query answering with transitive and linear-ordered data Journal of Artificial Intelligence Research | 2018-11-01 | Paper |
| Interpolation with decidable fixpoint logics 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| A Step Up in Expressiveness of Decidable Fixpoint Logics Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| The complexity of boundedness for guarded logics 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Two-way cost automata and cost logics over infinite trees 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) | 2018-04-23 | Paper |
| Effective interpolation and preservation in guarded logics 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) | 2018-04-23 | Paper |
| Effective interpolation and preservation in guarded logics ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Deciding the weak definability of Büchi definable tree languages | 2017-02-02 | Paper |
| On the Expressive Power of Cost Logics over Infinite Words Automata, Languages, and Programming | 2012-11-01 | Paper |
| Quasi-weak cost automata: a new variant of weakness | 2012-08-31 | Paper |
| Weak cost monadic logic over infinite trees Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Research outcomes over time
This page was built for person: Michael Vanden Boom
