Terminating modal tableaux with simple completenness proof - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Terminating modal tableaux with simple completenness proof

Résumé

In this paper we study formal tools for the definition of tableaux systems for modal logics. We begin by some preliminaries about graphs. Then we present graph rewriting rules together with control constructs for defining strategies of application of these rules. We establish fair strategies that are sound, complete and terminating. These results cover almost all basic modal logics such as K, T, S4, KB4, K+Confluence etc., and can be generalized for logics such LTL and PDL. Our framework provides the theoretical basis for our generic tableau theorem prover LoTREC.
Fichier non déposé

Dates et versions

hal-03537176 , version 1 (20-01-2022)

Identifiants

  • HAL Id : hal-03537176 , version 1

Citer

Olivier Gasquet, Andreas Herzig, Mohamad Sahade. Terminating modal tableaux with simple completenness proof. Conference on Advances in Modal Logic (AIML 2006), Sep 2006, Noosa, Queensland, Australia. pp.167-186. ⟨hal-03537176⟩
17 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More