A General Theorem Prover for Quantified Modal Logics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

A General Theorem Prover for Quantified Modal Logics


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. The fair deterministic proof-search strategy used by the prover is described and illustrated via a meaningful example.
Fichier principal
Vignette du fichier
thio-cial-cerr-Tableaux2002.pdf (353.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00935268 , version 1 (23-01-2014)



Virginie Thion, Serenella Cerrito, Marta Cialdea. A General Theorem Prover for Quantified Modal Logics. TABLEAUX - Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, 2002, Copenhagen, Denmark. pp.266-280, ⟨10.1007/3-540-45616-3_19⟩. ⟨hal-00935268⟩
114 View
168 Download



Gmail Facebook Twitter LinkedIn More