Computing Theory Prime Implicates in Modal Logic

  • Manoj K. Raut
  • Tushar V. Kokane
  • Rishabh Agarwal
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 736)

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.

Keywords

Modal logic Theory prime implicates Knowledge compilation 

Notes

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.

References

  1. 1.
    Bienvenu, M.: Prime implicates and prime implicants: from propositional to modal logic. J. Artif. Intell. Res. (JAIR) 36, 71–128 (2009)MathSciNetMATHGoogle Scholar
  2. 2.
    Bienvenu, M.: Consequence finding in modal logic. Ph.D. thesis, Université Paul Sabatier, 7 May 2009Google Scholar
  3. 3.
    Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)MATHGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Commun. Eur. J. AI 10, 137–150 (1998)Google Scholar
  6. 6.
    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)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Kean, A., Tsiknis, G.: An incremental method for generating prime implicants/implicates. J. Symb. Comput. 9(2), 185–206 (1990)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Marquis, P.: Knowledge compilation using theory prime implicates. In: Proceedings of International Joint conference on Artificial Intelligence, IJCAI 1995, pp. 837–843 (1995)Google Scholar
  10. 10.
    Raut, M.K., Singh, A.: Prime implicates of first order formulas. IJCSA 1(1), 1–11 (2004)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Raut, M.K.: Computing Theory Prime Implicates in Modal logic. https://arxiv.org/abs/1512.08366

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Manoj K. Raut
    • 1
  • Tushar V. Kokane
    • 1
  • Rishabh Agarwal
    • 1
  1. 1.Dhirubhai Ambani Institute of Information and Communication TechnologyGandhinagarIndia

Personalised recommendations