fast algorithms for revision of some special propositional knowledge bases
文献类型：期刊论文
| 作者 | Luan SM ; Dai GZ |
| 刊名 | JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
 |
| 出版日期 | 2003 |
| 卷号 | 18期号:3页码:388-392 |
| 关键词 | propositional base revision computational complexity polynomial algorithm |
| ISSN号 | 1000-9000 |
| 学科主题 | Computer Science, Hardware & Architecture; Computer Science, Software Engineering |
| 收录类别 | SCI ; ACM |
| 语种 | 英语 |
| 公开日期 | 2011-07-29 |
| 附注 | In this paper, the computational complexity of propositional clause set counterfactuals is discussed. It is shown that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and that the computational complexity of propositional Horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore, some polynomial algorithms are presented for some special propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time. |
| 源URL | [http://124.16.136.157/handle/311060/13170]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Luan SM,Dai GZ. fast algorithms for revision of some special propositional knowledge bases[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2003,18(3):388-392. |
| APA | Luan SM,&Dai GZ.(2003).fast algorithms for revision of some special propositional knowledge bases.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,18(3),388-392. |
| MLA | Luan SM,et al."fast algorithms for revision of some special propositional knowledge bases".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 18.3(2003):388-392. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。