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

模态逻辑中基于归结的素蕴涵计算算法

An Algorithm for Computing Prime Implicates in Modal Logic Using Resolution

Manoj K. Raut

摘要:

本文利用\cite{Enjalbert}提出的归结方法,给出了一个计算$\mathbf{K}$中模态公式素蕴涵的算法。本文提出的算法需要多项式时间指数时间,即$O(n^{2k}\times 2^{n})$计算素数蕴涵,而Binevenu的算法\cite{Bienvenu}计算素数蕴涵需要双指数时间。我们也证明了它的正确性。

英文摘要:

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.

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

↑