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.