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

删除策略的相容性
引用本文:程晓春. 删除策略的相容性[J]. 计算机学报, 1998, 21(2): 176-182
作者姓名:程晓春
作者单位:吉林大学计算机科学系,长春,130023
基金项目:国家自然科学基金,国家863高科技基金
摘    要:本文给出关于删除策略相容性的几个结果,对相同谓词符号配用锁的子句集,锁归结和删除策略联用完备,对正文字锁大于负文字锁的Horn集,正单元锁归和删降策略联用完备,输入锁结与删除策略联用完备,配锁Horn集上输入半锁归结和删除联用完备的,标准Horn集上正单元强有序归结和删除策略联用完备,强有序输入归结和删除策略联用完备。

关 键 词:删除策略 锁归结 序归结 相容性 计算机
修稿时间:1996-03-20

ON COMPATIBILITY OF DELETION STRATEGY
CHENG Xiao-Chun. ON COMPATIBILITY OF DELETION STRATEGY[J]. Chinese Journal of Computers, 1998, 21(2): 176-182
Authors:CHENG Xiao-Chun
Abstract:Some results on compatibility of deletion strategy are obtained in thispaper. Using deletion strategy, lock resolution is complete for the clause set whereliterals with the same predicate symbol have the same index: both positive unit lockresolution and input lock resolution are complete for the Horn set where the indexesof positive literals are greater than the indexes of negative literals;input half-lockresolution is complete for Horn set; both positive unit strong ordered resolution andstrong ordered input resolution are complete for standard Horn set.
Keywords:Deletion strategy   lock resolution   unit resolution   input resolution  ordered resolution
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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