首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  免费   1篇
  国内免费   1篇
自动化技术   5篇
  2015年   1篇
  2007年   1篇
  2002年   1篇
  1998年   1篇
  1996年   1篇
排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
2.
超协调限制逻辑LPc是一种同时具有非单调性和超协调性的非经典逻辑,它可作为在不完全与不协调知识下常识推理的形式化.给出了命题LPc的计算复杂性结果和算法实现,指出LPc是NP完全问题,并给出了将LPc转化为等价的优先限制逻辑的线性时间算法,由于限制逻辑具有实用的实现算法且可用归结方法实现,因而该算法为LPc的实现提供了新的途径.  相似文献   
3.
朱三元  朱福喜 《计算机工程与设计》2007,28(22):5482-5484,5487
次协调逻辑用于解决在含有矛盾的系统中如何进行有效推理的问题,基于扩充真值的APC是对经典谓词演算的扩展,APC归结能够用于次协调系统的自动推理.设计了既能在协调的环境下,也能在不协调的环境下进行有效推理的自动推理系统,实现了提高推理效率的多种策略.  相似文献   
4.
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure. The programs may also be prioritized, that is, their clauses may be arranged in a partial order that reflects preferences among the corresponding rules. This yields a robust framework for representing knowledge in logic programs with a considerable expressive power. The declarative semantics for such programs is particularly suitable for reasoning with uncertainty, in the sense that it pinpoints the incomplete and inconsistent parts of the data, and regards the remaining information as classically consistent. As such, this semantics allows to draw conclusions in a non-trivial way, even in cases that the logic programs under consideration are not consistent. Finally, we show that this formalism may be regarded as a simple and flexible process for belief revision.  相似文献   
5.
We study inconsistency and unsatis ability and their relation to soundness, completeness, paraconsistency and conservative extension in generic logical systems (formalized as institutions equipped with an entailment system).  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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