A Principled Approach to Reasoning about Discrete Dynamic Systems

从技术系统中的离散控制到业务流程，再到化学反应中原子变化的键，离散动态现象在广泛的背景下都能找到。尽管这些动态现象千差万别，但这些通常以离散事件或行动为概念的动态现象可以用共同的基本原则来描述。这些原则应该用一种便于分析的数学语言正式表示。这有助于设计可随后部署在各种应用程序中的通用解决方案。拟议的研究计划有助于开发行动及其影响的一般原则性表征，并演示如何使用这些表征来执行关于行动的直接和间接影响的易于计算的推理。存在几个概念和计算挑战，阻碍了现有的原则性表示和推理机制为解决现实世界的问题做出实际贡献。拟议的研究计划的目标是解决其中的一些挑战。它们包括识别在实际应用中经常出现的离散动态系统的种类，以及研究使用原则性逻辑表示法来对这些系统进行建模。这项研究将侧重于应用一阶逻辑技术来解决大规模规划问题。特别是，当初始知识不完整时，需要探索如何使用提升的一阶逻辑表示来解决确定性计划问题。拟议的研究将集中在可以开发出计算上容易处理的解决方案的情况。此外，还将探讨如何有效地处理具有间接影响的行动。通常，这些影响是使用因果规则来指定的；然而，很少有人知道关于间接影响的推理在计算上容易处理的情况下的情况与不能计算处理的情况之间的界限。此外，当行动产生间接影响时，如何才能取消第一订单计划的问题尚未得到探讨。这项研究的结果将是我们知识的进步和具有广泛适用性的技术的发展。

Discrete dynamic phenomena are found in a broad range of contexts from discrete control in technical systems, to business processes, to atoms changing bonds in chemical reactions. Despite their diversity, these dynamic phenomena, usually conceptualized in terms of discrete events or actions, can be described using common underlying principles. These principles should be formally represented in a mathematical language that facilitates their analysis. This helps to design general solutions that can be subsequently deployed in a variety of applications. The proposed research program contributes to developing general principled representations for actions and their effects, and to demonstrating how these representations can be used to perform computationally tractable reasoning about the direct and indirect effects of actions. There are several conceptual and computational challenges that prevent the existing principled representations and reasoning mechanisms from making practical contributions to solving real-world problems. The objective of the proposed research program is to address some of these challenges. They include identifying the kinds of discrete dynamical systems that frequently occur in practical applications and investigating the use of principled logical representations to model these systems. The proposed research will focus on application of first order logic techniques to solve large scale planning problems. In particular, there is a need to explore how lifted first order logic representations can be used to solve deterministic planning problems when initial knowledge is incomplete. The proposed research will concentrate on the cases where computationally tractable solutions can be developed. Also, it will be explored how can we deal efficiently with actions that have indirect effects. Often, these effects are specified using causal rules; yet, there is little known about a boundary separating the case when reasoning about indirect effects is computationally tractable from the case when it is not. Moreover, the question how lifted first order planning can be done when actions have indirect effects has not yet been explored. The outcome of this research will be advancement of our knowledge and the development of techniques with broad applicability.