摘要翻译:
1991年,Michael Gelfond引入了认知规范的语言。其目标是开发工具,用于建模需要某种形式的元推理的问题,即在多个可能的世界上进行推理。尽管它们与知识表示相关,但迄今为止,认知规范受到的关注相对较少。在本文中,我们重提认识规范的形式主义。我们给出了一个新的形式化定义,提出了几个语义(其中一个在句法限制下与Gelfond的原始语义等价),得到了一些复杂性结果,最后证明了Faber和Woltran最近考虑的需要元推理的问题的形式化建模的有效性。所有这些结果表明,认知规范应该得到更多的关注。
---
英文标题:
《Revisiting Epistemic Specifications》
---
作者:
Miroslaw Truszczynski
---
最新提交年份:
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中的材料。
--
---
英文摘要:
In 1991, Michael Gelfond introduced the language of epistemic specifications. The goal was to develop tools for modeling problems that require some form of meta-reasoning, that is, reasoning over multiple possible worlds. Despite their relevance to knowledge representation, epistemic specifications have received relatively little attention so far. In this paper, we revisit the formalism of epistemic specification. We offer a new definition of the formalism, propose several semantics (one of which, under syntactic restrictions we assume, turns out to be equivalent to the original semantics by Gelfond), derive some complexity results and, finally, show the effectiveness of the formalism for modeling problems requiring meta-reasoning considered recently by Faber and Woltran. All these results show that epistemic specifications deserve much more attention that has been afforded to them so far.
---
PDF链接:
https://arxiv.org/pdf/1108.3279