Answering complex queries over knowledge graphs (KG) is an important yet challenging task because of the KG incompleteness issue and cascading errors during reasoning. Recent query embedding (QE) approaches to embed the entities and relations in a KG and the first-order logic (FOL) queries into a low dimensional space, answering queries by dense similarity search. However, previous works mainly concentrate on the target answers, ignoring intermediate entities' usefulness, which is essential for relieving the cascading error problem in logical query answering. In addition, these methods are usually designed with their own geometric or distributional embeddings to handle logical operators like union, intersection, and negation, with the sacrifice of the accuracy of the basic operator - projection, and they could not absorb other embedding methods to their models. In this work, we propose a Neural and Symbolic Entangled framework (ENeSy) for complex query answering, which enables the neural and symbolic reasoning to enhance each other to alleviate the cascading error and KG incompleteness. The projection operator in ENeSy could be any embedding method with the capability of link prediction, and the other FOL operators are handled without parameters. With both neural and symbolic reasoning results contained, ENeSy answers queries in ensembles. ENeSy achieves the SOTA performance on several benchmarks, especially in the setting of the training model only with the link prediction task.
翻译:回答知识图表(KG)的复杂问题是一项重要但富有挑战性的任务,因为KG的不完整问题和推理过程中的分层错误。最近查询嵌入(QE)的方法将实体和关系嵌入一个KG和一阶逻辑(FOL)的精确度降低到一个低维空间,通过密集的相似性搜索回答问题。然而,以前的工作主要集中于目标答案,忽视中间实体的有用性,这是在逻辑查询中解答串联错误问题的关键。此外,这些方法通常是用自己的几何或分布嵌入来设计,处理逻辑操作者,如联盟、交叉和否定。最近查询嵌入(QE)的方法将实体和关系嵌入KG和第一阶逻辑逻辑(FOL)的精确度(QEEEE)查询,它们无法吸收其他嵌入模型的方法。在这项工作中,我们提出了一个用于复杂解答的神经和内嵌(ENSy)框架(ENS),这使得神经和象征推理推理推理能够减轻导错误和KG的不全。ENS的投算操作者可以不以任何符号推算方法在S的精确推算结果中进行。