HTab: A Terminating Tableaux System for Hybrid Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

HTab: A Terminating Tableaux System for Hybrid Logic


Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes, is based on the resolution method. An alternative to resolution is the tableaux method, already widely used for both modal and description logics. Tableaux algorithms have also been developed for a number of hybrid logics, and the goal of the present work is to implement one of them. In this article we present the implementation of a terminating tableaux algorithm for the basic hybrid logic. The performance of the tableaux algorithm is compared with the performances of HyLoRes and HyLoTab (a system based on a different tableaux algorithm). HTab is implemented in the functional language Haskell, using the Glasgow Haskell Compiler (GHC). The code is released under the GNU GPL and can be downloaded from
Fichier principal
Vignette du fichier
htabM4M.pdf (169.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00187300 , version 1 (14-11-2007)


  • HAL Id : inria-00187300 , version 1


Guillaume Hoffmann, Carlos Areces. HTab: A Terminating Tableaux System for Hybrid Logic. Methods for Modalities 5, Nov 2007, Cachan, France. ⟨inria-00187300⟩
142 View
152 Download


Gmail Facebook Twitter LinkedIn More