Towards Generalizable and Faithful Logic Reasoning over Natural Language via Resolution Refutation
<|reference_start|>Towards Generalizable and Faithful Logic Reasoning over Natural Language via Resolution Refutation: Large language models (LLMs) have achieved significant performance in various natural language reasoning tasks. However, they still struggle with performing first-order logic reasoning over formal logical theories expressed in natural language. This is because the previous LLMs-based reasoning systems have the theoretical incompleteness issue. As a result, it can only address a limited set of simple reasoning problems, which significantly decreases their generalization ability. To address this issue, we propose a novel framework, named Generalizable and Faithful Reasoner (GFaiR), which introduces the paradigm of resolution refutation. Resolution refutation has the capability to solve all first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction, so our system's completeness can be improved by introducing resolution refutation. Experimental results demonstrate that our system outperforms previous works by achieving state-of-the-art performances in complex scenarios while maintaining performances in simple scenarios. Besides, we observe that GFaiR is faithful to its reasoning process.<|reference_end|>
@article{sun2024towards,
    title={Towards Generalizable and Faithful Logic Reasoning over Natural Language
  via Resolution Refutation},
    author={Zhouhao Sun, Xiao Ding, Li Du, Bibo Cai, Jinglong Gao, Ting Liu, Qin
  Bing},
    journal={arXiv preprint arXiv:2404.01677},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.01677},
    primaryClass={cs.AI cs.CL}
}