发帖
雷达卡
摘要翻译：
在论证论方法的基础上，我们给出了关于动作推理问题的统一非单调解。相对于在时间命题逻辑之上引入的明智的最小化策略，我们的理论是可证明的正确的。复杂的问题域可以在我们的框架中形式化。由于该领域的研究人员一直关注于动作推理中的传统和基本问题，如框架问题、限定问题和分支问题，在我们的形式化中解决这些问题的方法是本文论述的核心。
---
英文标题：
《Reasoning about Action: An Argumentation - Theoretic Approach》
---
作者：
N. Y. Foo, Q. B. Vo
---
最新提交年份：
2011
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
We present a uniform non-monotonic solution to the problems of reasoning about action on the basis of an argumentation-theoretic approach. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic. Sophisticated problem domains can be formalised in our framework. As much attention of researchers in the field has been paid to the traditional and basic problems in reasoning about actions such as the frame, the qualification and the ramification problems, approaches to these problems within our formalisation lie at heart of the expositions presented in this paper.
---
PDF链接：
https://arxiv.org/pdf/1109.2138
京公网安备 11010802022788号
