# Computing Theory Prime Implicates in Modal Logic

Source: [Computing Theory Prime Implicates in Modal Logic](<https://www.sota2.com/research/paper/68fa629a1e209131ce9fa1c7>)

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

Data updated: 2025-10-25T20:22:26.903Z

Authors: Manoj K. Raut

Published: 2015-12-28T10:24:48.000Z

## Abstract

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 $X$ with respect to another knowledge base $\\Box Y$ using \\cite{Bienvenu}, where $Y$ is a propositional knowledge base and $X\\models Y$, in modal system $\\mathcal{T}$ 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 $X$ with respect to $\\Box Y$ is less than the size of the prime implicates of $X\\cup\\Box Y$.

## 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/1512.08366>)

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