语义链:从可达事实到有据可依的答案
Semantic Chains: From Reachable Facts to Justified Answers
Misha Andreev
AI 速读 基于摘要
该文在逻辑事实图模型下,研究如何从问题出发搜索到能支撑完整答案的根事实,并把论证组织成由若干相互衔接的陈述构成的语义链。
cs.CL
查看原文摘要
How can the facts that justify an answer be found from a question and presented as a sequence of connected statements? This paper models a context as a graph of logical facts and takes as given which expressions represent each fact. A parent fact can express a relation among its subfacts, and a preserving edge allows the content of a subfact to be recovered within a full representation of its parent. Suppose a root fact justifies the full answer and a path of preserving edges leads from that root to a fact that designates an object shared by the question and the answer. Under the conditions of the model, a search starting from the objects in the question reaches the root and covers every fact in the selected expansion. The root then admits a text that forms a single link connecting the question to the full answer and justifying it. For chains with several links, the paper gives a complete enumeration of candidate orders within the stated class and specifies when the link texts jointly preserve the justification and support every transition.