arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1512.08366cs.LO
收藏

模态逻辑中的计算理论素数

Computing Theory Prime Implicates in Modal Logic

Manoj K. Raut

摘要:

在\cite{Marquis}中提出了计算命题逻辑中的理论素蕴涵的算法。本文在模态系统$\mathcal{T}$中,利用\cite{Bienvenu}(其中$Y$是命题知识库,$X\models Y$是命题知识库),将该算法推广到计算一个知识库$X$相对于另一个知识库$\Box Y$的理论素蕴涵,并证明了其正确性。我们还证明了它是一个等价保持知识编译,并且$X$关于$\Box Y$的理论素蕴涵的大小小于$X\cup\Box Y$的素蕴涵的大小.

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑