基于多项式的知识库修正算法

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI:10.1109/PACRIM.2001.953733

X. Tao, C. Miao, Z. Q. Shen, Yuan Miao, Q. Miao

{"title":"基于多项式的知识库修正算法","authors":"X. Tao, C. Miao, Z. Q. Shen, Yuan Miao, Q. Miao","doi":"10.1109/PACRIM.2001.953733","DOIUrl":null,"url":null,"abstract":"Propositional knowledge base revision in intractable in the general case. This paper proposes an algorithm for proportional knowledge base revision. It is shown that the computational complexity is connected with the relationship between the number of formulas and the number of variables. A sufficient condition is provided to guarantee the algorithm is polynomial.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A polynomial algorithm for knowledge base revision\",\"authors\":\"X. Tao, C. Miao, Z. Q. Shen, Yuan Miao, Q. Miao\",\"doi\":\"10.1109/PACRIM.2001.953733\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Propositional knowledge base revision in intractable in the general case. This paper proposes an algorithm for proportional knowledge base revision. It is shown that the computational complexity is connected with the relationship between the number of formulas and the number of variables. A sufficient condition is provided to guarantee the algorithm is polynomial.\",\"PeriodicalId\":261724,\"journal\":{\"name\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2001.953733\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2001.953733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

命题知识库的修正在一般情况下是棘手的。提出了一种比例知识库修正算法。结果表明，计算复杂度与公式数量和变量数量之间的关系有关。给出了保证算法是多项式的充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A polynomial algorithm for knowledge base revision

Propositional knowledge base revision in intractable in the general case. This paper proposes an algorithm for proportional knowledge base revision. It is shown that the computational complexity is connected with the relationship between the number of formulas and the number of variables. A sufficient condition is provided to guarantee the algorithm is polynomial.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)

自引率

0.00%

发文量