arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.10106cs.AI
收藏

一阶逻辑推理的内隐学习

Implicitly Learning to Reason in First-Order Logic

University of Edinburgh(爱丁堡大学);Alan Turing Institute(艾伦·图灵研究所);Washington University in St. Louis(华盛顿大学圣路易斯分校)

Vaishak Belle, Brendan Juba

摘要:

我们考虑的问题回答查询的一阶逻辑公式的基础上的背景知识部分明确表示为其他公式,并部分表示为独立的例子从一个固定的概率分布。PAC语义,由Valiant引入,是一个严格的,一般的建议,学习推理的形式语言:虽然弱于经典蕴涵,它允许一个强大的模型理论框架回答查询,同时需要最少的假设的形式分布的问题。然而,到目前为止,这种方法的最重要的限制,以及更普遍的大多数具有鲁棒性保证的机器学习方法,是逻辑语言最终本质上是命题的,具有大量的原子。事实上,在这种普遍性中,关于关系理论学习的理论发现是非常消极的。尽管一阶逻辑被广泛认为是最适合表示人类知识的逻辑。在这项工作中,我们提出了一个新的理论方法来鲁棒地学习一阶逻辑推理,并考虑在可数无限域上普遍量化的子句。我们的研究结果利用了语言中的常量所表现出的对称性,并推广了隐式可学习性的概念,以显示如何根据(隐式)学习的一阶背景知识计算查询。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑