A method for explainable fact checking that models claim verification as probabilistic inference over knowledge graphs and mined rules using answer set programming.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Explainable Fact Checking with Probabilistic Answer Set Programming
A method for explainable fact checking that models claim verification as probabilistic inference over knowledge graphs and mined rules using answer set programming.