转换层将应用一个推理过程(类似于前推链接法)，并检查规划树中的每个节点，看哪些查询转换适用于该节点。
The transformation layer will apply an inference process (similar to forward-chaining) and check for each node in the plan tree to see which query transformations apply to that node.
文章对其推理的全部过程进行了较为清晰的拆解，然后主要以物质存在的层次性和层次之间“关节点”的矛盾性观点对芝诺的思想进行了破斥。
This article undertakes to reveal his reasoning of the whole process, and then employs a paradox of the level of being and key points between levels to refute Zeno's arguments.
该算法将封闭世界模型上的概念图推理转化为对博弈树根节点的可解性标示过程。
The algorithm translates the inference of Conceptual-Graphs, in a Closed World Model, to marking processes in Game-Trees.
应用推荐