基于理智主义者的观点，即“知道怎样”（know how）是“知道那么”（know that）的一个种类，我们将知道行动归结为知道某些命题。并且像动态逻辑那样，我们把一个行动理解成在某个给定世界上的输入-输出有序对集合，这里忽略行动的中间过程，强调行动的输入-输出状态。在这样的预设下，主体知道一个行动就表示为知道相应行动的输入-输出状态组成的二元关系，即主体能够判断任意一个有序对是否在这个行动所表示的二元关系中。随着就有了一个知道行动的直观解释：“对任意两个状态x,y，如果x Rα y，那么这个主体知道它，即Kx Rα y；否则主体知道¬x Rα y”。 进而，我们在一阶认知逻辑中对知道行动进行分析，用一个一阶认知公式来定义知道行动。在一阶模态逻辑的语义列表（Tableaux）规则的基础上，将认知逻辑三个重要的公理增加到规则中，由此就扩充得到了一阶认知逻辑的列表系统。本文在一阶认知逻辑系统中，用列表的方法对知道行动的一般性质进行了证明，如知道行动的正自省性、负自省性。此外，我们还证明了知道复杂行动的一些事实，例如知道行动的持续组合、知道行动的选择、知道行动的重复执行的一些事实。本文用一阶认知逻辑的列表的方法来刻画了知道行动的一般性质和一些重要事实，我们希望以此为起点，进一步进行更深层次的研究。

We suggest that knowing an action can be described by knowledge of propositions. This opinion is based on the view of intellectualism, which is `know how' can be reduced into `know that'. According to Dynamic Logic, an action is commonly considered as a binary relation which represents input states and output states of that action. This suggestion ignores all the intermediate details. Knowing an action means that knowing all the ordered pairs in the binary relation of the action. That is, for any ordered pair, a knower can decide whether it is in this relation. Based on this intuition, the meaning of that an agent knows an action is `for any two states x,y, if x Rα y then the agent knows it, otherwise the agent knows ¬x Rα y'. Further, we use first-order epistemic language (FOEL) to analyse knowing an action and define knowing an action by a first-order epistemic formula. The tableaux for FOEL are obtained by augmenting the tableaux for the basic first-order modal logic. With the help of the tableaux for FOEL, we show several general properties of knowing an action, such as the Positive Introspection, Negative Introspection. And we show some facts of knowing an complex action, such as knowing sequential combination, knowing choice, and so on. In this paper, we describe the properties and some facts of knowing an action by the tableaux for FOEL. On this basis, we will make a deeper research in the future.