首页 | 本学科首页   官方微博 | 高级检索  
     

正规逻辑程序回答集存在性研究
引用本文:方毅立,赵岭忠,钱俊彦.正规逻辑程序回答集存在性研究[J].计算机科学,2011,38(12):213-220.
作者姓名:方毅立  赵岭忠  钱俊彦
作者单位:1. 桂林电子科技大学广西可信软件重点实验室桂林541004
2. 桂林电子科技大学广西可信软件重点实验室桂林541004;武汉大学软件工程国家重点实验室 武汉430072
基金项目:国家自然基金(60803033,61063002); 广西自然基金(2011GXNSFA018166,2011GXNSFA018164); 武汉大学软件工程国家重点实验室开放基金项目(SKLSE2010-08-06); 广西研究生教育创新计划资助项目(2010105950812M28)资助
摘    要:判断逻辑程序的回答集是否存在是回答集程序设计的一个重要问题,也是NP完全问题。当前利用否定圈边数的奇偶性来判断回答集存在性的方法还具有一定的局限性,即:对于非分层逻辑程序,现有方法并不能准确判断其回答集存在性。针对该问题,提出了一种新的基于否定圈的判断方法,给出了该判断方法的算法框架,证明了算法的正确性,并以实例分析说明了方法的有效性。

关 键 词:回答集逻辑程序,回答集,划分集,否定圈

Existence of Answer Sets of Normal Logic Programs
FANG Yi-li,ZHAO Ling-zhong,QIAN Jun-yan.Existence of Answer Sets of Normal Logic Programs[J].Computer Science,2011,38(12):213-220.
Authors:FANG Yi-li  ZHAO Ling-zhong  QIAN Jun-yan
Affiliation:FANG Yi-li1 ZHAO Ling-zhong1,2 QIAN Jun-yan1(Guangxi Provincial Key Lab of Trusted Software,Guilin University of Electronic Technology,Guilin 541004,China)1(State Key Lab of Software Engineering,Wuhan University,Wuhan 430072,China)2
Abstract:Determining the existence of answer sets of logic programs is a key problem in answer set programming, and is also NP-complete. Current methods for determining the existence of answer sets are mainly based on the evenness/oddness of the number of edges in negative circles.The limitation of this kind of methods is that if a normal logic program is not stratified, the existence of answer sets of the program cannot be accurately determined. A novel negative circle based method was proposed to solve this problem. An algorithmic framework and the correctness of the method were presented in this paper, and its effectiveness was illustrated by example analysis.
Keywords:Answer set programming  Answer set  Splitting set  Negative cycle
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号