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

处理 Wikidata 限定符的推理

Handling Wikidata Qualifiers in Reasoning

University of Geneva(日内瓦大学)

Sahar Aljalbout, Gilles Falquet, Didier Buchs

AI总结:

针对 Wikidata 推理中限定符处理难题,提出限定符分类与多类逻辑及代数规范相结合的方法,实现有效推理并给出原型。

摘要:

Wikidata 是一个知识图谱,越来越多地被许多社区采用以用于各种应用。Wikidata 陈述用限定符-值对进行标注,这些限定符-值对用于描述信息,例如陈述的有效性上下文、其因果关系、来源等。在推理中处理限定符是一个具有挑战性的问题。当定义推理规则(特别是关于本体属性的规则,如 (x 是 y 的子类,z 是 x 的实例等))时,必须考虑限定符,因为它们中的大多数参与了陈述的语义。这带来了一个复杂的问题,因为 a) 限定符的数量庞大,且 b) 推断出的陈述的限定符通常是规则条件中限定符的组合。在这项工作中,我们提出通过 a) 定义限定符的分类,以及 b) 使用多类逻辑语言形式化 Wikidata 模型来解决这个问题;该语言的种类是限定符类别。我们将这种逻辑与代数规范相结合,该规范提供了一种在推理规则中有效处理限定符的方法。利用 Wikidata 的本体属性,我们展示了如何使用多类逻辑和规范来对限定符进行推理。最后,我们讨论了实际实现该工作的方法论,并展示了一个原型实现。由于多类代数规范的可扩展性,这项工作可以自然地扩展,以涵盖规范中更多的限定符,例如不确定时间、重复事件、地理位置等。

英文摘要:

Wikidata is a knowledge graph increasingly adopted by many communities for diverse applications. Wikidata statements are annotated with qualifier-value pairs that are used to depict information, such as the validity context of the statement, its causality, provenances, etc. Handling the qualifiers in reasoning is a challenging problem. When defining inference rules (in particular, rules on ontological properties (x subclass of y, z instance of x, etc.)), one must consider the qualifiers, as most of them participate in the semantics of the statements. This poses a complex problem because a) there is a massive number of qualifiers, and b) the qualifiers of the inferred statement are often a combination of the qualifiers in the rule condition. In this work, we propose to address this problem by a) defining a categorization of the qualifiers b) formalizing the Wikidata model with a many-sorted logical language; the sorts of this language are the qualifier categories. We couple this logic with an algebraic specification that provides a means for effectively handling qualifiers in inference rules. Using Wikidata ontological properties, we show how to use the MSL and specification to reason on qualifiers. Finally, we discuss the methodology for practically implementing the work and present a prototype implementation. The work can be naturally extended, thanks to the extensibility of the many-sorted algebraic specification, to cover more qualifiers in the specification, such as uncertain time, recurring events, geographic locations, and others.

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

↑