中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Evaluating epistemic negation in answer set programming
Author: Shen, YD ; Eiter, T
Keyword: Answer set programming ; Epistemic negation ; Semantics
Source: ARTIFICIAL INTELLIGENCE
Issued Date: 2016
Volume: 237, Pages:115-135
Indexed Type: SCI
Department: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. Vienna Univ Technol, Inst Informat Syst, Favoritenstr 9-11, A-1040 Vienna, Austria.
Abstract: Epistemic negation not along with default negation (sic) plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing epistemic approaches such as those by Gelfond [13,15,14], Truszczynski [33] and Kahl et al. [18] behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M (KF and MF are shorthands for (sic)not F and not(sic)F, respectively). In this paper we present a new approach to handling epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were introduced by Gelfond [13] over two decades ago. We consider general logic programs consisting of rules of the form H <- B, where H and B are arbitrary first-order formulas possibly containing epistemic negation, and define a general epistemic answer set semantics for general logic programs by introducing a novel program transformation and a new definition of world views in which we apply epistemic negation to minimize the knowledge in world views. The general epistemic semantics is applicable to extend any existing answer set semantics, such as those defined in [26,27,32,1,8,12,29], with epistemic negation. For illustration, we extend FLP answer set semantics of Faber et al. [8] for general logic programs with epistemic negation, leading to epistemic FLP semantics. We also extend the more restrictive well justified FLP semantics of Shen et al. [29], which is free of circularity for default negation, to an epistemic well justified semantics. We consider the computational complexity of epistemic FLP semantics and show that for a propositional program II with epistemic negation, deciding whether II has epistemic FLP answer sets is Sigma(p)(3)-complete and deciding whether a propositional formula F is true in II under epistemic FLP semantics is Sigma(p)(4)-complete in general, but has lower complexity for logic programs that match normal epistemic specifications, where the complexity of world view existence and query evaluation drops by one level in the polynomial hierarchy. (C) 2016 The Authors. Published by Elsevier B.V.
English Abstract: Epistemic negation not along with default negation (sic) plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing epistemic approaches such as those by Gelfond [13,15,14], Truszczynski [33] and Kahl et al. [18] behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M (KF and MF are shorthands for (sic)not F and not(sic)F, respectively). In this paper we present a new approach to handling epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were introduced by Gelfond [13] over two decades ago. We consider general logic programs consisting of rules of the form H <- B, where H and B are arbitrary first-order formulas possibly containing epistemic negation, and define a general epistemic answer set semantics for general logic programs by introducing a novel program transformation and a new definition of world views in which we apply epistemic negation to minimize the knowledge in world views. The general epistemic semantics is applicable to extend any existing answer set semantics, such as those defined in [26,27,32,1,8,12,29], with epistemic negation. For illustration, we extend FLP answer set semantics of Faber et al. [8] for general logic programs with epistemic negation, leading to epistemic FLP semantics. We also extend the more restrictive well justified FLP semantics of Shen et al. [29], which is free of circularity for default negation, to an epistemic well justified semantics. We consider the computational complexity of epistemic FLP semantics and show that for a propositional program II with epistemic negation, deciding whether II has epistemic FLP answer sets is Sigma(p)(3)-complete and deciding whether a propositional formula F is true in II under epistemic FLP semantics is Sigma(p)(4)-complete in general, but has lower complexity for logic programs that match normal epistemic specifications, where the complexity of world view existence and query evaluation drops by one level in the polynomial hierarchy. (C) 2016 The Authors. Published by Elsevier B.V.
Language: 英语
WOS ID: WOS:000377828500005
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17313
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
1-s2.0-S0004370216300455-main.pdf(640KB)----限制开放 联系获取全文

Recommended Citation:
Shen, YD,Eiter, T. Evaluating epistemic negation in answer set programming[J]. ARTIFICIAL INTELLIGENCE,2016-01-01,237:115-135.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Shen, YD]'s Articles
[Eiter, T]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Shen, YD]‘s Articles
[Eiter, T]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace