C. Areces, P. Blackburn, and M. Marx, A Road-Map on Complexity for Hybrid Logics, Computer Science Logic, number 1683 in LNCS, pp.307-321
DOI : 10.1007/3-540-48168-0_22
URL : https://hal.archives-ouvertes.fr/inria-00000337

C. Areces and D. Gorín, Ordered resolution with selection for H(@), Proceedings of LPAR 2004, pp.125-141, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000332

T. Bolander and P. Blackburn, Decidable tableau calculi for modal and temporal hybrid logics extending K, 2007.

T. Bolander and P. Blackburn, Termination for Hybrid Tableaus, Journal of Logic and Computation, vol.17, issue.3, pp.517-554, 2007.
DOI : 10.1093/logcom/exm014

J. Van-eijck, HyLoTab ? Tableau-based theorem proving for hybrid logics. manuscript, CWI, available from http, 2002.

V. Haarslev and R. Möller, RACER System Description, Lecture Notes in Computer Science, vol.2083, pp.701-705, 2001.
DOI : 10.1007/3-540-45744-5_59

I. Horrocks and P. Patel-schneider, Optimising description logic subsumption, 1998.

M. Kaminski and G. Smolka, A straightforward saturation-based decision procedure for hybrid logic, International Workshop on Hybrid Logic, 2007.