# An Algorithm for Computing Prime Implicates in Modal Logic Using Resolution

Source: [An Algorithm for Computing Prime Implicates in Modal Logic Using Resolution](<https://www.sota2.com/research/paper/68fa65821e209131cea0aa53>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T21:28:43.855Z

Authors: Manoj K. Raut

Published: 2018-11-12T05:49:09.000Z

## Abstract

In this paper we have proposed an algorithm for computing prime implicates of a modal formula in $\\mathbf{K}$ using resolution method suggested in \\cite{Enjalbert}. The algorithm suggested in this paper takes polynomial times exponential time ,i.e, $O(n^{2k}\\times 2^{n})$ to compute prime implicates whereas Binevenu's algorithm \\cite{Bienvenu} takes doubly exponential time to compute prime implicates. We have also proved its correctness.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1811.04566>)

[PDF](<https://arxiv.org/pdf/1811.04566.pdf>)
