default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Vanden Boom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i3]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/2202.08555 (2022)- 2021
- [j5]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): 13:1-13:69 (2021)
2010 – 2019
- 2019
- [j4]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [j3]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63: 191-264 (2018) - 2017
- [c11]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. ICALP 2017: 107:1-107:14 - [i2]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. CoRR abs/1705.01823 (2017) - 2016
- [j2]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8 (2016) - [c10]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. IJCAI 2016: 893-899 - [c9]Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS 2016: 817-826 - [i1]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/1607.00813 (2016) - 2015
- [c8]Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom:
The Complexity of Boundedness for Guarded Logics. LICS 2015: 293-304 - [c7]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Interpolation with Decidable Fixpoint Logics. LICS 2015: 378-389 - 2014
- [c6]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective interpolation and preservation in guarded logics. CSL-LICS 2014: 13:1-13:10 - [c5]Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. CSL-LICS 2014: 16:1-16:9 - 2013
- [c4]Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom:
Deciding the weak definability of Büchi definable tree languages. CSL 2013: 215-230 - 2012
- [b1]Michael Vanden Boom:
Weak cost automata over infinite trees. University of Oxford, UK, 2012 - [c3]Denis Kuperberg, Michael Vanden Boom:
On the Expressive Power of Cost Logics over Infinite Words. ICALP (2) 2012: 287-298 - 2011
- [c2]Denis Kuperberg, Michael Vanden Boom:
Quasi-Weak Cost Automata: A New Variant of Weakness. FSTTCS 2011: 66-77 - [c1]Michael Vanden Boom:
Weak Cost Monadic Logic over Infinite Trees. MFCS 2011: 580-591
2000 – 2009
- 2007
- [j1]Julia F. Knight, Sara Miller, Michael Vanden Boom:
Turing computable embeddings. J. Symb. Log. 72(3): 901-918 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
