# Multi-modal logic programming using equational and order-sorted logic

## Abstract

In previous work [2] we proposed a method for automated modal theorem proving based on algebraic concepts and equational techniques. Basically, it uses the translation of Modal Logic into a specially tailored multi-sorted logic called Path Logic. In this paper we extend the method for Multi-Modal logic and apply it to Multi-Modal Logic Programming. The Multi-Modal systems we consider are arbitrary mixing of first order modal systems of type KD,KT,KD4 or KT4, with interaction axioms of the form □_{i}A - □_{j}A. Roughly, with each modal subsystem is associated a sort in Path Logic and a specific set of equations, and the interaction axioms are captured by the order relation between sorts. Hence, again, all the modal-logical rules are coded in the unification algorithm. If one considers Horn clauses (in the usual sense) we get a Logic Programming system — PATHLOG- for which standard theoretical results apply. In PATHLOG one can either write programs directly in the language of Path Logic or in various Multi-Modal Logics, the modal formulas being automatically translated and put in clausal form. For instance we obtain as a particular case a system for Temporal Logic Programming which subsumes TEMPLOG of [1], and whose completeness results immediately from our general theorems.

The paper begins with a brief introduction to Multi-Modal Logic. In section 2 we define Path Logic and the translation from Multi-Modal Logic. Section 3 presents PATHLOG and SLD Resolution, illustrated with two examples in section 4. Finally, a comparison with other approaches of Modal Logic Programming is discussed in the conclusion.

## Keywords

Modal Logic Logic Programming Order-sorted Logic Equationnal Methods Unification E-Resolution## Preview

Unable to display preview. Download preview PDF.

## References

- [1]M. Abadi, Z. Manna,
*Temporal Logic Programming*, Proc. IEEE Symposium on Logic Programming, San Francisco, 1987.Google Scholar - [2]Y. Auffray, P. Enjalbert,
*Modal theorem proving using equational methods*, Proc. 11^{th}Int. Joint Conf. on Artif. Intell., Detroit, 1989.Google Scholar - [3]L. Catach,
*Normal Multimodal Logics*, Proc. Nat. Conf. on Artif. Intel.'88, S^{t}Paul, Minesota, 1988.Google Scholar - [4]F.Debart, M. Lescot,
*Extension de la logique des chemins à la logique multi-modale: théorie et implémentation*, Technical Report "Les cahiers du LIUC" 90-4, 1990.Google Scholar - [5]F.Debart, P. Enjalbert, M. Lescot,
*Multi-Modal Automated Deduction Using Equational And Order-Sorted Logic*, Proc. 2nd Conf. on Conditional and Typed Rewriting Systems, Montreal, To appear in Springer LNCS, M.Okada & S.Kaplan Ed., 1990.Google Scholar - [6]L. Farinas,
*MOLOG: a system that extends PROLOG with Modal Logic*, New Generation Computing, vol 4, n^{o}1, 35–50, 1986.Google Scholar - [7]L. Farinas, A. Herzig,
*Quantified modal logic and unification theory*, Rapport LSI n^{o}293, Université P. Sabatier, Toulouse, France 1988.Google Scholar - [8]D.M. Gabbay,
*Modal and Temporal Logic Programming*, Temporal Logics and their applications, A. Galton Ed, Academic Press, 197–237, 1987.Google Scholar - [9]R. Goldblatt,
*Logics of Time and Computation*, CSLI-SRI Publications, 1987.Google Scholar - [10]J.Y. Halpern, Y.O Moses,
*A guide to the Modal Logics of Knowledge and Belief*, Proc. Inter. Conf. on Reasoning about Knowledge, 1986.Google Scholar - [11]C. Kirchner,
*Order-Sorted Equational Unification*, 5^{th}Int. Conf. on Logic. Prog., 1988.Google Scholar - [12]J.W. Lloyd,
*Foundations of Logic programming*, Springer-Verlag, 1984.Google Scholar - [13]R.C. Moore,
*Reasoning about Knowledge and Action*, PhD Thesis, MIT, Cambridge, Massachussets, 1980.Google Scholar - [14]H.J. Ohlbach,
*A Resolution Calculus for Modal Logics*, 9^{th}Int. Conf. on Automated Deduction, LNCS 310, Springer Verlag, 1988.Google Scholar - [15]M. Okada,
*Mathematical basis of Modal Logic Programming*, Proc JELIA'88, Cahier du LIUC n^{o}89-5, Université de Caen, France, 1988.Google Scholar - [16]M.A. Orgun, W.W. Wadge,
*Towards a Unified Theory of Intensional Logic Programming*, Technical report, Dept. of Comput. Scie., University of Victoria, B.C., Canada, Nov. 1989.Google Scholar - [17]G. Plotkin,
*Building in equational theories*, Machine Intelligence 7, 73–90, 1972.Google Scholar - [18]M. Schmidt-Schauss,
*Unification in many-sorted equational theories*, Proc. 8th Int. Conf. on Automated deduction (Oxfoerd, England), Springer LNCS 230, 1986.Google Scholar - [19]C. Walther,
*A many-sorted calculus based on resolution and paramodulation*, Research notes in Artificial Intelligence, Pitman, London 1987.Google Scholar