Abstract
Hybrid languages are modal languages that allow direct reference to the elements of a model. Even the basic hybrid language \( {\text{(}}\mathcal{H}{\text{(@))}} \), which only extends the basic modal language with the addition of nominals (i,j, k,...) and satisfiability operators (@ i , @ j , @ k ,...), increases the expressive power: it can explicitly check whether the point of evaluation is a specific, named point in the model (w ⊩ i), and whether a named point satisfies a given formula (w ⊩ @ iϕ ). The extended expressivity allows one to define elegant decision algorithms, where nominals and @ play the role of labels, or prefixes, which are usually needed during the construction of proofs in the modal setup [5,3]. Note that they do so inside the object language. All these features we get with no increase in complexity: the complexity of the satisfiability problem for \( \mathcal{H}{\text{(@)}} \) is the same as for the basic modal language, PSPACE [2]. When we move to very expressive hybrid languages containing binders, we obtain an impressive boost in expressivity, but usually we also move beyond the boundaries of decidability. Classical binders like ∀ and ∃ (together with @) make the logic as expressive as first-order logic (FOL) while adding the more “modal” binder ↓ gives a logic weaker than FOL [1]. We refer to the Hybrid Logic site at http://www.hylo.net for a broad on-line bibliography.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Areces. Logic Engineering. The Case of Description and Hybrid Logics. PhD thesis, ILLC, University of Amsterdam, The Netherlands, October 2000.
C. Areces, P. Blackburn, and M. Marx. Hybrid logic: Characterization, interpolation and complexity. J. Symb. Logic, 66(3):977–1010, 2001
C. Areces, H. de Nivelle, and M. de Rijke. Resolution in modal, description and hybrid logic. J. Logic and Comp., 11(5):717–736, 2001.
Y. Auffray, P. Enjalbert, and J. Hebrard. Strategies for modal resolution: results and problems. J. Autom. Reas., 6(1):1–38, 1990.
P. Blackburn. Internalizing labelled deduction. J. Logic and Comp., 10(1):137–168, 2000.
V. Haarslev and R. Möller. RACE system description. InA. Borgida, R. Möller M. Lenzerini, and P. Patel-Schneider, (eds.) Proc. of the 1999 Int. Workshop on Description Logics (DL’99), 1999 Lambrix et al. [9], pages 130–132.
I. Horrocks. FaCT and iFaCT. In A. Borgida, R. Möller M. Lenzerini, and P. Patel-Schneider, (eds.) Proc. of the 1999 Int. Workshop on Description Logics (DL’99), 1999 Lambrix et al. [9], pages 133–135.
U. Hustadt, R. A. Schmidt, and C. Weidenbach. MSPASS: Subsumption testing with SPASS. In A. Borgida, R. Möller M. Lenzerini, and P. Patel-Schneider, (eds.) Proc. of the 1999 Int. Workshop on Description Logics (DL’99), 1999Lambrix et al. [9], pages 136–137.
P. Lambrix, A. Borgida, R. Möller M. Lenzerini, and P. Patel-Schneider, (eds.) Proc. of the 1999 Int. Workshop on Description Logics (DL’99), 1999.
F Massacci. Design and results of the tableaux-99 non-classical (modal) systems comparison. In N. Murray, (ed.), Proc. of TABLEAUX’99, number 1617 of LNAI, pages 14–18. Springer, 1999.
P. Patel-Schneider. DLP system description. In E. Franconi, G. De Giacomo, R. MacGregor, W. Nutt, and C. Welty, (eds.), Proc. of the 1998 Int. Workshop on Description Logics (DL’98), pages 87–89, 1998.
G. Robinson and L. Wos. Paramodulation and theorem-proving in first-order theories with equality. In Mach. Int. 4:135–150, 1969.
A. Voronkov. Algorithms, datastructures, and other issues in efficient automated deduction. In R. Goré, A. Leitsch, and T. Nipkow, (eds.), Automated Reasoning. 1st. Int. Joint Conf., IJCAR 2001, number 2083 of LNAI, pages 13–28, Italy, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Areces, C., Heguiabehere, J. (2002). HyLoRes 1.0: Direct Resolution for Hybrid Logics. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive