LangPro: Natural Language Theorem Prover

Abzianidze, L., 6-Sep-2017, p. 115-120. 5 p.

Research output: Contribution to conferencePaperAcademic

LangPro is an automated theorem prover for natural language ( 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. %This property makes the logical forms easily obtainable from syntactic trees. %, in particular, Combinatory Categorial Grammar derivation trees. 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.
Original languageEnglish
Number of pages5
Publication statusPublished - 6-Sep-2017
EventConference on Empirical Methods in Natural Language Processing: System Demonstrations - Copenhagen, Denmark
Duration: 7-Sep-201711-Sep-2017


ConferenceConference on Empirical Methods in Natural Language Processing
Abbreviated titleEMNLP
Internet address


Conference on Empirical Methods in Natural Language Processing: System Demonstrations


Copenhagen, Denmark

Event: Conference


  • cs.CL, 68T50, I.2.7

Download statistics

No data available

ID: 48976222