Title :
A polynomial algorithm for knowledge base revision
Author :
Tao, X.H. ; Miao, C.Y. ; Shen, Z.Q. ; Yuan Miao ; Miao, Q.H.
Author_Institution :
School of Info-Commun. Technol., Singapore Polytech., Singapore
fDate :
6/23/1905 12:00:00 AM
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
Keywords :
deductive databases; truth maintenance; SAT problem; computational complexity; polynomial algorithm; propositional knowledge base revision; propositonal logic; Artificial intelligence; Computational complexity; Knowledge management; Logic; Polynomials; Sufficient conditions;
Conference_Titel :
Communications, Computers and signal Processing, 2001. PACRIM. 2001 IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-7080-5
DOI :
10.1109/PACRIM.2001.953733
