More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

Michael Vanden Boom

◀ ▶ joint publications with Pierre Bourhis

> Home > Persons > Michael Vanden Boom

Publications

2022
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2202-08555
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2202-08555
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/2202.08555 (2022)
2021
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/tocl/BenediktBCPB21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/BenediktBCPB21
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)
2019
[j4]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/lmcs/BenediktBB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/BenediktBB19
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Definability and Interpolation within Decidable Fixpoint Logics. Log. Methods Comput. Sci. 15(3) (2019)
2018
[j3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jair/AmarilliBBB18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jair/AmarilliBBB18
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]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/BenediktBB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/BenediktBB17
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. ICALP 2017: 107:1-107:14
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/BenediktBB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BenediktBB17
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Characterizing Definability in Decidable Fixpoint Logics. CoRR abs/1705.01823 (2017)
2016
[c10]
- view
  - electronic edition @ ijcai.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ijcai/AmarilliBBB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/AmarilliBBB16
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. IJCAI 2016: 893-899
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/BenediktBB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/BenediktBB16
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
A Step Up in Expressiveness of Decidable Fixpoint Logics. LICS 2016: 817-826
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/AmarilliBBB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AmarilliBBB16
Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/1607.00813 (2016)

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.