A General Theorem Prover for Quantified Modal Logics

  • V. Thion
  • S. Cerrito
  • Marta Cialdea Mayer
Conference paper

DOI: 10.1007/3-540-45616-3_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2381)
Cite this paper as:
Thion V., Cerrito S., Mayer M.C. (2002) A General Theorem Prover for Quantified Modal Logics. In: Egly U., Fermüller C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science, vol 2381. Springer, Berlin, Heidelberg

Abstract

The main contribution of this work is twofold. It presents a modular tableau calculus, in the free-variable style, treating the main domain variants of quantified modal logic and dealing with languages where rigid and non-rigid designation can coexist. The calculus uses, to this end, light and simple semantical annotations. Such a general proof-system results from the fusion into a unified framework of two calculi previously defined by the second and third authors. Moreover, the work presents a theorem prover, called GQML-Prover, based on such a calculus, which is accessible in the Internet. The fair deterministic proof-search strategy used by the prover is described and illustrated via a meaningful example.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • V. Thion
    • 1
  • S. Cerrito
    • 1
  • Marta Cialdea Mayer
    • 2
  1. 1.L.R.I.Université de Paris-SudFrance
  2. 2.Dipartimento di Informatica e AutomazioneUniversità di Roma TreItaly

Personalised recommendations