This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method for special case, and gives its corresponding polynomial algorithm.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Gardenfors P. Epistemic importance and minimal changes of belief. Australasian J. Philos, 1984, 62: 136–157.
Huang Zhisheng. Theory and Methods of Belief Revision.Computer Science, 1991, (6): 12–16. (in Chinese)
Eiter T, Gottlob G. On the complexity of propositional knowledge base revision, updates, and counterfactuals.Artificial Intelligence, 1992, 57: 227–270.
Katsuno H, Medelzon A O. On the difference between updating a knowledge base and revising it. InProc. KR-91, 1991, pp.387–395.
Grahne G. Updates and counterfactuals. InProc. KR-91, 1991, pp. 269–276.
Nebel B. Belief revision and default reasoning: Syntax-based approaches. InProc. KR-91, 1991, pp. 417–428.
Winslett M. Updating Logical Databases. Cambridge University Press, Cambridge, England, 1990.
Ma Shaohan. Algorithm Analysis and Design. Shandong University Press, 1992. (in Chinese)
The research was supported by National Natural Science Foundation and National 863 Programme of China.
Tao Xuehong was born in 1969. She received her Ph.D. degree in computer software from Shandong University. Now she is a Lecturer of Department of Computer Science, Shandong University. Her research interests include knowledge base revision.
Sun Wei was born in 1966. He received his Ph.D. degree in computer software from Shandong University. Now he is a Lecturer of Department of Computer Science, Shangdong University. His research interests include AI and parallel algorithm.
Ma Shaohan was born in 1938. He is now a Professor and the Dean of Department of Computer Science, Shandong University. His research interests include AI and parallel algorithm.
About this article
Cite this article
Tao, X., Sun, W. & Ma, S. A practical propositional knowledge base revision algorithm. J. of Comput. Sci. & Technol. 12, 154–159 (1997). https://doi.org/10.1007/BF02951334
- Propositional knowledge base
- satisfiability problem