Abstract
The algorithm to compute theory prime implicates, a generalization of prime implicates, in propositional logic has been suggested in [9]. As a preliminary result, in this paper we have extended that algorithm to compute theory prime implicates of a modal knowledge base X with respect to another modal knowledge base \(\Box Y\) using [1], 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\wedge \Box Y\). We have also extended the query answering algorithm in modal logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bienvenu, M.: Prime implicates and prime implicants: from propositional to modal logic. J. Artif. Intell. Res. (JAIR) 36, 71–128 (2009)
Bienvenu, M.: Consequence finding in modal logic. Ph.D. thesis, Université Paul Sabatier, 7 May 2009
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on the Theory of Computing, pp 151–158. ACM Press (1971)
Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Commun. Eur. J. AI 10, 137–150 (1998)
Cerro, L.F.D., Penttonen, M.: A note on the complexity of the satisfiability of modal Horn clauses. J. Logic Program. 4, 1–10 (1987)
Kean, A., Tsiknis, G.: An incremental method for generating prime implicants/implicates. J. Symb. Comput. 9(2), 185–206 (1990)
de Kleer, J.: An improved incremental algorithm for generating prime implicates. In: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI 1992, pp. 780–785. AAAI Press (1992)
Marquis, P.: Knowledge compilation using theory prime implicates. In: Proceedings of International Joint conference on Artificial Intelligence, IJCAI 1995, pp. 837–843 (1995)
Raut, M.K., Singh, A.: Prime implicates of first order formulas. IJCSA 1(1), 1–11 (2004)
Raut, M.K.: An incremental algorithm for computing prime implicates in modal logic. In: Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 8402, pp. 188–202 (2014)
Raut, M.K.: Computing Theory Prime Implicates in Modal logic. https://arxiv.org/abs/1512.08366
Acknowledgement
Authors thank the National Board for Higher Mathematics, Department of Atomic Energy, Mumbai, India for financial support under grant reference number 2/48(16)/2014/NBHM(R.P.)/R&D II/1392.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Raut, M.K., Kokane, T.V., Agarwal, R. (2018). Computing Theory Prime Implicates in Modal Logic. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2017. Advances in Intelligent Systems and Computing, vol 736. Springer, Cham. https://doi.org/10.1007/978-3-319-76348-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-76348-4_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76347-7
Online ISBN: 978-3-319-76348-4
eBook Packages: EngineeringEngineering (R0)