Abstract
Standard logic programming languages like Prolog lack the possibility of dealing with modalities and/or sorts. A first idea how to overcome this problem (and that without changing anything on Prolog itself) would be to apply the well-known relational translation approaches from modal and sorted logic into first-order predicate logic and to feed this translation result into Prolog. This, however, leads into other problems: firstly, the transformed problem is usually of much bigger size (number of clauses) than the original one and, secondly, very often it is not even in Horn form anymore.
In this paper a translation approach is proposed which avoids both of these problems, i.e. the number of clauses after translation is exactly as big as it would have been if we simply ignored the modal operators and sort restrictions and, also, the result is in Horn form provided it was already before (modulo modal operators and sorts).
Preview
Unable to display preview. Download preview PDF.
References
Yves Auffray and Patrice Enjalbert. Modal theorem proving: An equational viewpoint. Journal of Logic and Computation, 2(3):247–295, 1992.
Luis Fariñas del Cerro and Andreas Herzig. Quantified modal logic and unification theory. Rapport LSI 293, Languages et Systèmes Informatique, Université Paul Sabatier, Toulouse, 1988.
Andr≸s Nonnengart. First-order modal logic theorem proving and standard PROLOG. Technical Report MPI-I-92-228, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, July 1992.
Andreas Nonnengart. First-order modal logic theorem proving and functional simulation. In Ruzena Bajcsy, editor, Proceedings of the 13th IJCAI, volume 1, pages 80–85. Morgan Kaufmann Publishers, 1993.
Hans Jürgen Ohlbach. A resolution calculus for modal logics. In Ewing Lusk and Ross Overbeek, editors, Proc. of 9 th International Conference on Automated Deduction, CADE-88 Argonne, IL, volume 310 of LNCS, pages 500–516, Berlin, Heidelberg, New York, 1988. Springer-Verlag, extended version: SEKI Report SR-88-08, FB Informatik, Universität Kaiserslautern, 1988.
Hans Jürgen Ohlbach. A Resolution Calculus for Modal Logics. PhD thesis, University of Kaiserslautern, Germany, 1989.
Hans Jürgen Ohlbach. Semantics-based translation methods for modal logics. Journal of Logic and Computation, 1(5):691–746, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nonnengart, A. (1994). How to use modalities and sorts in Prolog. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021985
Download citation
DOI: https://doi.org/10.1007/BFb0021985
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58332-5
Online ISBN: 978-3-540-48657-2
eBook Packages: Springer Book Archive