Abstract
In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which incorporates a restricted (“analytic”) version of the cut rule, with a label formalism which allows for a specialised, logic-dependent unification algorithm. The system provides a uniform proof-theoretical treatment of first-order (normal) modal logics with and without the Barcan Formula and/or its converse.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alberto Artosi, Paola Cattabriga, and Guido Governatori. An Automated Approach to Normative Reasoning. In Joost Breuker, editor, Artificial Normative Reasoning, pages 132–145, Amsterdam, 1994. ECAI'94.
Alberto Artosi, Paola Cattabriga, and Guido Governatori. KED: A Deontic Theorem Prover. In C. Biagioli, G. Sartor, and D. Tiscornia, editors, Workshop on Legal Application of Logic Programming, ICLP'94, Firenze, IDG, 1994: 60–76.
Y. Auffray and P. Enjalbert. Modal Theorem Proving: An Equational Viewpoint. Journal of Logic and Computation, 2, 1992: 247–259.
Alberto Artosi and Guido Governatori. Labelled Model Modal Logic. In Workshop on Automated Model Building, CADE 12, Nancy, 1994: 11–17.
M. Abadi and Z. Manna. Modal Theorem Proving. In J. H.Siekmann (ed.), Proceedings of 8th International Conference on Automated Deduction, LNCS, Vol. 230, Springer Verlag, 1986: 172–189.
Marcello D'Agostino and Marco Mondadori. The Taming of the Cut. Journal of Logic and Computation, 4, 1994: 285–319.
Melvin Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, 1983.
M. Fitting. First-Order Modal Tableaux. Journal of Automated Reasoning, 4, 1988: 191–213.
Melvin Fitting. Basic Modal Logic. In C.J. Hogger, Dov M. Gabbay, and J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1. Oxford University Press, Oxford, 1993: 368–448.
Dov M. Gabbay. Investigations in Modal and Tense Logics. Reidel, Dordrecht, 1976.
Dov M. Gabbay. Classical vs Non-Classical Logics. In C.J. Hogger, Dov M. Gabbay, and J.A. Robinson (eds), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, Oxford University Press, Oxford, 1994: 359–500.
Ian Gent. Theory Matrices (for Modal Logics) Using Alphabetical Monotonicity. Studia logica, 52, 1993: 233–257.
Guido Governatori. Labelled Tableaux for Multi-Modal Logics. In P. Baumgartner, R. Hähnle and J. Posegga (eds.), Theorem Proving with Analytic Tableaux and Related Methods, LNAI, Vol. 918, Springer-Verlag, Berlin, 1995: 79–94.
Guido Governatori. A Duplication and Loop Checking Free System for S4. In P. Miglioli, U. Moscato, D. Mundici and M. Ornaghi (eds.) 5 th Workshop on Theoprem Proving with Analytic tableaux and Related Methods (Short Popers), Technical report 154-96, Università di Milano, 1996: 19–32.
G.E. Hughes and M.J. Cresswell. An Introduction to Modal Logic. Methuen, London, 1968.
Peter Jackson and Han Reichgelt. Logic-Based Knowledge Representation. Chapter A General Proof Method for Modal Predicate Logic, MIT Press, Cambridge Mass., 1989: 177–228.
Saul Kripke. Semantical Considerations on Modal Logics. Acta Philosophica Fennica, 16, 1963: 83–94.
Hans Jürgen Ohlbach. Semantic Based Translation Methods for Modal Logics. Journal of Logic and Computation, 1, 1991: 691–746.
L. Wallen. Automated Deduction in Nonclassical Logics. MIT Press, Cambridge Mass., 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Artosi, A., Benassi, P., Governatori, G., Rotolo, A. (1996). Labelled proofs for quantified modal logic. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-61630-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61630-6
Online ISBN: 978-3-540-70643-4
eBook Packages: Springer Book Archive