Certification of Prefixed Tableau Proofs for Modal Logic - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Certification of Prefixed Tableau Proofs for Modal Logic


Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the general project of establishing a common specification language in order to certify proofs given in a wide range of deductive formalisms. In particular, by using a translation from the modal language into a first-order polarized language and a checker whose small kernel is based on a classical focused sequent calculus, we are able to certify modal proofs given in labeled sequent calculi, prefixed tableaux and free-variable prefixed tableaux. We describe the general method for the logic K, present its implementation in a Prolog-like language, provide some examples and discuss how to extend the approach to other normal modal logics.
Fichier principal
Vignette du fichier
LibVol-GandALF16.pdf (230.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01379625 , version 1 (11-10-2016)



Tomer Libal, Marco Volpe. Certification of Prefixed Tableau Proofs for Modal Logic. the Seventh International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016), Sep 2016, Catania, Italy. pp.257 - 271, ⟨10.4204/EPTCS.226.18⟩. ⟨hal-01379625⟩
152 View
212 Download



Gmail Facebook X LinkedIn More