Graduate School and Research Center in Digital Sciences

Explainable fact checking with probabilistic answer set programming

Ahmadi, Naser; Papotti, Paolo; Saeed, Mohammed

TTO 2019, Conference for truth and trust Online, 4-5 October 2019, London, UK

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. 

Arxiv Bibtex

Title:Explainable fact checking with probabilistic answer set programming
Type:Conference
Language:English
City:London
Country:UNITED KINGDOM
Date:
Department:Data Science
Eurecom ref:5942
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in TTO 2019, Conference for truth and trust Online, 4-5 October 2019, London, UK and is available at :
Bibtex: @inproceedings{EURECOM+5942, year = {2019}, title = {{E}xplainable fact checking with probabilistic answer set programming}, author = {{A}hmadi, {N}aser and {P}apotti, {P}aolo and {S}aeed, {M}ohammed}, booktitle = {{TTO} 2019, {C}onference for truth and trust {O}nline, 4-5 {O}ctober 2019, {L}ondon, {UK}}, address = {{L}ondon, {UNITED} {KINGDOM}}, month = {10}, url = {http://www.eurecom.fr/publication/5942} }
See also: