Logical facts chains reveal justified answers from questions

Semantic Chains: From Reachable Facts to Justified Answers

Computation and Language

Summary

Finding the facts that support an answer is tricky, especially when these facts connect in complicated ways. This paper shows how to organize facts as a graph where each fact links logically to others, and how to trace from a question to the answer through this network. The authors describe how to find a clear path of related facts that together justify the answer, ensuring the chain preserves meaning at each step. This helps explain how an answer follows logically from the question in a detailed, structured way.

What this means in practice

A theory result. No direct application yet.

Authors

Misha Andreev

Abstract

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.