LangPro: Natural Language Theorem Prover

Lasha Abzianidze · 2017

LangPro is an automated theorem prover for natural language.1 Given a set of premises and a hypothesis, it is able to prove semantic relations between them.The prover is based on a version of analytic tableau method specially designed for natural logic.The proof procedure operates on logical forms that preserve linguistic expressions to a large extent.The nature of proofs is deductive and transparent.On the FraCaS and SICK textual entailment datasets, the prover achieves high results comparable to state-of-the-art.

Read the paper · More papers on PaperTik