We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed probability distribution. PAC semantics, introduced by Valiant, is one rigorous, general proposal for learning to reason in formal languages: although weaker than classical entailment, it allows for a powerful model theoretic framework for answering queries while requiring minimal assumptions about the form of the distribution in question. To date, however, the most significant limitation of that approach, and more generally most machine learning approaches with robustness guarantees, is that the logical language is ultimately essentially propositional, with finitely many atoms. Indeed, the theoretical findings on the learning of relational theories in such generality have been resoundingly negative. This is despite the fact that first-order logic is widely argued to be most appropriate for representing human knowledge. In this work, we present a new theoretical approach to robustly learning to reason in first-order logic, and consider universally quantified clauses over a countably infinite domain. Our results exploit symmetries exhibited by constants in the language, and generalize the notion of implicit learnability to show how queries can be computed against (implicitly) learned first-order background knowledge.
Knowledge Graph Reasoning with Logics and Embeddings: Survey and Perspective
Zhejiang University(浙江大学);University of Oxford(牛津大学);The University of Edinburgh(爱丁堡大学);Alibaba-Zhejiang University Joint Research Institute of Frontier Technologies(阿里巴巴-浙江大学前沿技术联合研究院);Hangzhou Innovation Center, Zhejiang University(浙江大学杭州国际科创中心)
RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs
Université de Montréal(蒙特利尔大学);Mila - Québec AI Institute(米拉 - 魁北克人工智能研究所);Canadian Institute for Advanced Research (CIFAR)(加拿大高等研究院);HEC Montréal(蒙特利尔高等商学院);Tsinghua University(清华大学)
Plausible Reasoning and First-Order Plausible Logic
School of Information and Communication Technology, Nathan campus, Griffith University, Brisbane, Queensland 4111, Australia(信息与通信技术学院,纳瑟恩校区,格里菲斯大学,布里斯班,昆士兰4111,澳大利亚)
QMFOL: Benchmarking Large Language Model Reasoning via Quantifiable Monadic First-Order Logic Test Case Generation
Huazhong University of Science and Technology(华中科技大学);Nanyang Technological University(南洋理工大学);Hubei University(湖北大学);East China Normal University(华东师范大学);National University of Singapore(新加坡国立大学)
Logical Structure as Knowledge: Enhancing LLM Reasoning via Structured Logical Knowledge Density Estimation
Huzhou University(湖州大学);Zhejiang Key Laboratory of Intelligent Education Technology and Application(浙江智能教育技术与应用重点实验室);Banbu AI Foundation(Banbu AI基金会);Baichuan Inc(白川公司);University of Edinburgh(爱丁堡大学);Zhejiang University(浙江大学)