Skip to main content
Log in

Abstract

We describe simple semantic tableau based theorem provers for four standard modal logics, in both propositional and first-order versions. These theorem provers are easy to implement in Prolog, have a behavior that is straightforward to understand, and provide natural places for the incorporation of heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi, M. and Manna, Z., ‘Modal theorem proving’, in 8th International Conference on Automated Deduction, edited by J. H. Siekmann, pp. 172–179, Lecture Notes in Computer Science, vol. 230, Springer-Verlag (1986).

  2. Andrews, P., ‘Theorem Proving via General Matings’, Journal of the Assoc. Comp. Mach. 28, 193–214 (1981).

    Google Scholar 

  3. Beth, E. W., The Foundations of Mathematics, revised edition, North-Holland, Amsterdam (1964); first edition (1959).

    Google Scholar 

  4. Fitting, M. C., ‘Tableau methods of proof for modal logics’, Notre Dame Journal of Formal Logic 13, 237–247 (1972).

    Google Scholar 

  5. Fitting, M. C., Proof Methods for Modal and Intuitionistic Logics, D. Reidel Publishing Co., Dordrecht (1983).

    Google Scholar 

  6. Fitting, M. C. ‘Resolution for intuitionistic logic’, Methodologies for Intelligent Systems, edited by Zbigniew Ras and Maria Zemankova, edspp. 400–407, North-Holland, Amsterdam (1987).

    Google Scholar 

  7. Geissler, C. and Konolige, K., ‘A resolution method for quantified modal logics of knowledge and belief’, in Reasoning About Knowledge, Proceedings of the 1986 Conference, pp. 309–324, edited by J. Halpern, Morgan Kaufmann Publishers (1986).

  8. Gentzen G., ‘Untersuchungen über das logische Schliessen’, Mathematische Zeitschrift, 39, 176–210, 405–431; translated in The Collected Papers of Gerhard Gentzen, edited by M. E. Szabo, North-Holland, Amsterdam (1969).

  9. Herbrand, J., ‘Investigations in Proof Theory’, English trans. in Jacques Herbrand Logical Writings, edited by Warren D. Goldfarb,eds Harvard University Press, Cambridge (1971).

    Google Scholar 

  10. Ketonen, J. and Weyhrauch, R., ‘A decidable fragment of predicate calculus’, Theoretical Computer Science 32, 297–307 (1984).

    Google Scholar 

  11. Kripke, S., ‘Semantical analysis of modal logic I, normal propositional calculi’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9, 67–96 (1963).

    Google Scholar 

  12. Kripke S., ‘Semantical considerations on modal logics’, Acta Philosophica Fennica, Modal and Manyvalued Logics, pp. 83–94 (1963).

  13. Review, ‘Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic’, paper by M. Cialdea, reviewer G. E. Mints, Math. Reviews, review 87j:03016, p. 5407 (1987).

  14. O'Keefe, R., Programming Meta-Logical Operations in Prolog, DAI Working Paper No. 142, Department of Artificial Intelligence, University of Edinburgh (1983).

  15. Robinson, J. A., ‘A machine-oriented logic based on the resolution principle’, J. Assoc. Comput. Mach. 12, 23–41 (1965).

    Google Scholar 

  16. Smullyan, R. M., First-Order Logic, Springer-Verlag, Berlin (1968).

    Google Scholar 

  17. Stirling, L. and Shapiro, E., The Art of Prolog, MIT Press, Cambridge (1986).

    Google Scholar 

  18. Wallen, L. A., Matrix proof methods for modal logics (unpublished).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fitting, M. First-order modal tableaux. J Autom Reasoning 4, 191–213 (1988). https://doi.org/10.1007/BF00244394

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00244394

Key words

Navigation