Approximate answering of graph queries

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

Documents

  • Fulltext

    Submitted manuscript, 311 KB, PDF document

  • Michael Cochez
  • Dimitrios Alivanistos
  • Arakelyan, Erik
  • Max Berrendorf
  • Daniel Daza
  • Mikhail Galkin
  • Pasquale Minervini
  • Mathias Niepert
  • Hongyu Ren

Knowledge graphs (KGs) are inherently incomplete because of incomplete world knowledge and bias in what is the input to the KG. Additionally, world knowledge constantly expands and evolves, making existing facts deprecated or introducing new ones. However, we would still want to be able to answer queries as if the graph were complete. In this chapter, we will give an overview of several methods which have been proposed to answer queries in such a setting. We will first provide an overview of the different query types which can be supported by these methods and datasets typically used for evaluation, as well as an insight into their limitations. Then, we give an overview of the different approaches and describe them in terms of expressiveness, supported graph types, and inference capabilities.

Original languageEnglish
Title of host publicationCompendium of Neurosymbolic Artificial Intelligence
Number of pages14
PublisherIOS Press
Publication date2023
Pages373-386
Chapter17
ISBN (Print)9781643684062
ISBN (Electronic)9781643684079
DOIs
Publication statusPublished - 2023
SeriesFrontiers in Artificial Intelligence and Applications
Volume369
ISSN0922-6389

Bibliographical note

Publisher Copyright:
© 2023 The authors and IOS Press. All rights reserved.

ID: 391745468