LangPro is a tableau-based theorem prover for natural logic and language. See the online demo (not the latest version).
Given a set of premises and a hypothesis in natural language, LangPro tries to find out semantic relation between them: entailment (i.e. yes), contradiction (i.e. no) or neutral (i.e. unknown).
For this, LangPro needs CCG (Combinatory Categorial Grammar) derivations of the linguistic expressions in order to obtain Lambda Logical Forms (LLFs) from them via the LLFgen (LLF generator) component. The architecture is depicted below:
____________ ________ ___________ ________________________ __________
|Premises &| | CCG | derivations | LLF | LLFs |Tableau Theorem Prover| |Semantic|
|Hypothesis|--->|Parser|------------>|Generator|----->| for Natural Logic |--->|relation|
‾‾‾‾‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾‾‾
If you use the theorem prover, please cite Abzianidze (2017):
@inproceedings{abzianidze-2017-langpro,
title = "{L}ang{P}ro: Natural Language Theorem Prover",
author = "Abzianidze, Lasha",
booktitle = "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing: System Demonstrations",
month = sep,
year = "2017",
address = "Copenhagen, Denmark",
publisher = "Association for Computational Linguistics",
url = "https://www.aclweb.org/anthology/D17-2020",
doi = "10.18653/v1/D17-2020",
pages = "115--120"
}
For the manual on how to use the prover or how to obtain reported results, consult the wiki.