 |
|
|
|
 |
 |
 |
|
 |
|
 |
|
|
| 蔡和熙,林作铨,陈沐天.超协调限制逻辑的计算复杂性分析.软件学报,1998,9(11):839-844 |
| 超协调限制逻辑的计算复杂性分析 |
| An Analysis on Complexity of Paraconsistent Circumscription |
| 投稿时间：1997-07-02 修订日期：1997-11-05 |
| DOI： |
| 中文关键词: 悖论逻辑,限制逻辑,超协调限制逻辑,计算复杂性,非单调性,超协调性,NP完全性. |
| 英文关键词:Logic of paradox, circumscription, paraconsistent circumscption, computational complexity, nonmonotonicy, paraconsistency, NP-completeness. |
| 基金项目:本文研究得到国家自然科学基金、国家863高科技项目基金和广东省自然科学基金资助. |
|
| 摘要点击次数: 2092 |
| 全文下载次数: 2458 |
| 中文摘要: |
| 超协调限制逻辑LPc是一种同时具有非单调性和超协调性的非经典逻辑，它可作为在不完全与不协调知识下常识推理的形式化.给出了命题LPc的计算复杂性结果和算法实现，指出LPc是NP完全问题，并给出了将LPc转化为等价的优先限制逻辑的线性时间算法，由于限制逻辑具有实用的实现算法且可用归结方法实现，因而该算法为LPc的实现提供了新的途径. |
| 英文摘要: |
| Paraconsistent circumscription LPc is a non-classical logic which has both nonmonotonicity and paraconsistency. It can be viewed as a formalism of commonsense reasoning with incomplete and inconsistent knowledge. In this paper, the results of computational complexity on propositional LPc and its implementation algorithm is presented. It is showed that LPc is NP-complete. A linear algorithm to transform LPc into equivalent prioritized circumscription is provided. Because there are a number of useful algorithms for circumscription which could be implemented by resolution, a new way to implementation of LPc is drawn. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
|
|
|
|
|
|
 |
|
|
|
|
 |
|
 |
|
 |
|
