2 research outputs found
Computing Theory Prime Implicates in Modal Logic
The algorithm to compute theory prime implicates, a generalization of prime
implicates, in propositional logic has been suggested in \cite{Marquis}. In
this paper we have extended that algorithm to compute theory prime implicates
of a knowledge base with respect to another knowledge base using
\cite{Bienvenu}, where is a propositional knowledge base and ,
in modal system and we have also proved its correctness. We have
also proved that it is an equivalence preserving knowledge compilation and the
size of theory prime implicates of with respect to is less than
the size of the prime implicates of .Comment: 20 page
An Algorithm for Computing Prime Implicates in Modal Logic Using Resolution
In this paper we have proposed an algorithm for computing prime implicates of
a modal formula in using resolution method suggested in
\cite{Enjalbert}. The algorithm suggested in this paper takes polynomial times
exponential time ,i.e, to compute prime implicates
whereas Binevenu's algorithm \cite{Bienvenu} takes doubly exponential time to
compute prime implicates. We have also proved its correctness