.png){kind=icon}
返回
Stable models and circumscription
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2010.04.011.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based on a syntactic transformation similar to parallel circumscription. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Answer set programming
Circumscription
Nonmonotonic reasoning
Program completion
Stable models
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
查看更多内容