Explainable Fact Checking with Probabilistic Answer Set Programming

By Naser Ahmadi, Joohyung Lee, Paolo Papotti, Mohammed Saeed. 2019

59 citations recorded by the source corpus.

One challenge in fact checking is the ability to improve the transparency of the decision. We present a fact checking method that uses reference information in knowledge graphs (KGs) to assess claims and explain its decisions. KGs contain a formal representation of knowledge with semantic descriptions of entities and their relationships. We exploit such rich semantics to produce interpretable explanations for the fact checking output. As information in a KG is inevitably incomplete, we rely on logical rule discovery and on Web text mining to gather the evidence to assess a given claim. Uncertain rules and facts are turned into logical programs and the checking task is modeled as an inference problem in a probabilistic extension of answer set programs. Experiments show that the probabilistic inference enables the efficient labeling of claims with interpretable explanations, and the quality of the results is higher than state of the art baselines.

Subfields: Artificial Intelligence, Natural Language Processing, Knowledge Graphs & Representation

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Neema Kotonya
  2. Preslav Nakov
  3. Francesca Toni
  4. Giovanni Da San Martino
  5. Alberto Barrón-Cedeño
  6. Naser Ahmadi
  7. Stefano Ortona
  8. Paolo Papotti

In Natural Language Processing

  1. Neema Kotonya
  2. Francesca Toni
  3. Alberto Barrón-Cedeño
  4. Preslav Nakov
  5. David P. A. Corney
  6. Paolo Papotti
  7. Giovanni Da San Martino
  8. Firoj Alam

In Knowledge Graphs & Representation

  1. Neema Kotonya
  2. Francesca Toni
  3. Preslav Nakov
  4. Paolo Papotti
  5. Naser Ahmadi

Citations in the corpus