Representing Properties of Actions in Extensions of Logic Programming

这是与埃尔帕索得克萨斯大学的迈克尔·格尔方德博士共同研究的成果。本研究的目标是开发、研究和实现逻辑程序设计的声明性扩展中表示动作属性的形式化方法。该项目的理论部分是基于非单调推理的数学理论。实验部分采用演绎数据库系统。具体目标是(1)发展使用否定作为失败和经典否定来表示动作的性质的方法，并研究它们与基于限定和其他非单调形式的表示的关系，(2)使用演绎数据库系统来实现这些表示，(3)将这项工作扩展到包括连续时间和并发的动作模型，(4)探讨利用溯因逻辑程序设计实现过去推理自动化的可能性。

This is joint work with Dr. Michael Gelfond at the University of Texas, El Paso. The goal of this research is to develop, study and implement formalisms for representing properties of actions in declarative extensions of logic programming. The theoretical part of the project is based on the mathematical theory of nonmonotonic reasoning. The experimental part uses deductive database systems. The specific aims are (1) to develop methods for representing properties of actions using both negation as failure and classical negation, and to study their relation to the representations based on circumscription and other nonmonotonic formalisms, (2) to implement these representations using deductive database systems, (3) to extend this work to the models of action that include continuous time and concurrency, (4) to investigate the possibility of using abductive logic programming for the automation of reasoning about the past.