An Algorithm for Computing Prime Implicates in Modal Logic

11/12/2018

∙

by   Manoj K. Raut, et al.

∙

0

∙

share

In this paper we have proposed an algorithm for computing prime implicates of a modal formula in K using direct resolution method suggested in Enjalbert. We have also proved its correctness and studied its complexity.