Best solving modal equations

Annals of Pure and Applied Logic

Volumn 102, Issue 3, 2000, Pages 183-198

  Ghilardi, Silvio ^a  

^a Dipartimento di Scienze dell'Informazione   (Italy)

Author keywords

03B20; 03B45; 08B30; 68T15; Admissible inference rules; E unification; Modal logic; Primary; Secondary 06D20

Indexed keywords

EID: 0346739890     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(99)00032-9     Document Type: Article

References (13)

1. Baader F., Siekmann J.H. Unification theory. Gabbay D.M., Hogger C.J., Robinson J.A. Handbook of Logic in Artificial Intelligence and Logic Programming. 1993;41-125 Oxford University Press, Oxford.
2. Fine K. Logics containing K4, Part I. J. Symbolic Logic. 34:1974;31-42.
3. Fine K. Logics containing K4, Part II. J. Symbolic Logic. 50:1985;619-651.
4. Ghilardi S. Unification through projectivity. J. Logic Comput. 7(6):1997;733-752.
5. Ghilardi S. Unification in intuitionistic logic. J. Symbolic Logic. 69:1999;859-880.
6. S. Ghilardi, A resolution/tableaux algorithm for projective approximations in IPC, preprint 1998.
7. G.E. Hughes, M.J. Cresswell, A Companion to Modal Logic, Methuen, London, 1984.
8. Maksimova L.L. A classification of modal logics. Algebra i Logika. 18(3):1979;328-340.
9. U. Martin, T. Nipkow, Boolean unification - the story so far, J. Symbolic Comput. 7 1988, pp. 275-293.
10. H.J. Ohlbach, A resolution calculus for modal logic, Proceedings of the CADE, Lecture Notes in Computer Science, Springer, Berlin, 1988, pp. 500-516.
11. Ohlbach H.J. Semantics-based translation methods for modal logics. J. Logic Comput. 1(5):1991;691-746.
12. Rybakov V.V. Problems of substitution and admissibility in the modal system. Grz and in intuitionistic propositional calculus Ann. Pure Appl. Logic. 50:1990;71-106.
13. Siekmann J. Unification theory. J. Symbolic Comput. 7:1989;207-274.