14 Hybrid logics

Studies in Logic and Practical Reasoning

Volumn 3, Issue , 2007, Pages 821-868

  Areces, Carlos ^a   ten Cate, Balder ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849131209     PISSN: 15702464     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-2464(07)80017-6     Document Type: Article

References (146)

1. Aiello M., and van Benthem J. Logical Patterns in Space. In: Barker-Plummer D., Beaver D., van Benthem J., and Scotto di Luzio P. (Eds). Words, Proofs, and Diagrams (2002), CSLI, Stanford 5-25
2. July. Allen J. Towards a general theory of action and time. Artificial Intelligence 23 2 (1984) 123-154
3. C. Areces. HyLo: The hybrid logics' web site, http : / /hylo. loria. f r. Last visited: Dec/05.
4. October. Areces C. Logic Engineering. The Case of Description and Hybrid Logics. ILLC Dissertation Series DS-2000-05. PhD thesis (2000), University of Amsterdam
5. In: Areces C., and Blackburn P. (Eds). Methods for Modalities 3 (2003), Nancy, France
6. Areces C., Blackburn P., and Marx M. A road-map on complexity for hybrid logics. In: Flum J., and Rodríguez- Artalejo M. (Eds). Computer Science Logic. Proceedings of the 8th Annual Conference of the EACSL number 1683 in LNCS (1999), Springer 307-321
7. Areces C., Blackburn P., and Marx M. The computational complexity of hybrid temporal logics. Logic Journal of the IGPL 8 5 (2000) 653-679
8. Areces C., and Blackburn P. Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic 66 3 (2001) 977-1010
9. Areces C., Blackburn P., and Marx M. Repairing the interpolation lemma in quantified modal logic. Annals of Purend Applied Logics 123 1-3 (2003) 287-299
10. Areces C., de Nivelle H., and de Rijke M. Prefixed resolution: a resolution method for modal and description logics. Automated Deduction-CADE-16 (Trento, 1999) (1999), Springer, Berlin 187-201
11. Areces C., de Nivelle H., and de Rijke M. Resolution in modal, description and hybrid logic. Journal of Logic andComputation ll 5 (2001) 717-736
12. Areces C., and de Rijke M. From description to hybrid logics, and back. In: Wolter F., Wansing H., de Rijke M., and Zakharyaschev M. (Eds). Advances in Modal Logic Volume 3 (2001), CSLI Publications 17-36
13. In: Areces C., Franconi E., Goré R., de Rijke M., and Schlingloff H. (Eds). Methods for Modalities 1. Appeared as a Special Issue of the Logic Journal of the IGPL 8 (2000)
14. LNCS. Areces C., and Gorin D. Ordered resolution with selection for h(@). Springer. In: Baader F., and Voronkov A. (Eds). Proceed- ings of LPAR 2004 volume 3452 (2005) 125-141 Springer
15. C. Areces, J. Heguiabehere, D. Gorin, HyLoRes A hybrid logic resolution system http://www. loria. fr/~areces/HyLoRes. Last visited: Dec/05
16. In: Baader F., McGuiness D., Nardi D., and Patel-Schneider P. (Eds). The Description Logic Handbook: Theory, implementation and applications (2003), Cambridge University Press
17. chapter 2. Bachmair L., and Ganzinger H. Resolution theorem proving. Elsevier Science. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning Volume 1 (2001) 19-99
18. Barwise J. Admissible Sets and Structures (1975), Springer-Verlag
19. Bennett B. Modal logics for qualitative spatial reasoning. Logic Journal of the IGPL 4 1 (1996)
20. Bezhanishvili N., and ten Cate B. Transfer results for hybrid logic. Part I: the case without satisfaction operators. Journal of Logic and Computation 16 2 (2006) 177-197
21. Blackburn P. Nominal Tense Logic and Other Sorted Intensional Frameworks. PhD thesis (1990), Centre for Cognitive Science, University of Edinburgh, Edinburgh, United Kingdom
22. Blackburn P. Nominal tense logic. Notre Dame Journal of Formal Logic 34 1 (1992) 56-83
23. Blackburn P. Modal logic and attribute value structures. Synthese Language Library. In: de Rijke M. (Ed). Diamonds and Defaults (1993), Kluwer Academic Publishers, Dordrecht 19-65
24. Blackburn P. Tense, temporal reference and tense logic. Journal of Semantics 11 (1994) 83-101
25. Blackburn P. Internalizing labelled deduction. Journal of Logic and Computation 10 (2000) 136-168
26. P. Blackburn, Representation, reasoning, and relational structures: a Hybrid Logic manifesto Areces, 339-365, Appeared as a Special Issue of the Logic Journal of the IGPL, 8, (3)
27. Blackburn P. Modal logic as dialogical logic. Synthese 127 (2001) 57-93
28. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press
29. LNAI. Blackburn P., and Marx M. Tableaux for quantified hybrid logic. In: Egly U., and Fermüller C. (Eds). Automated rea- soning with analytic tableaux and related methods, TABLEAUX 2002 volume 2381 (2002), Springer Verlag 38-52
30. Blackburn P., and Marx M. Constructive interpolation in hybrid logic. The Journal of Symbolic Logic 68 2 (2003) 463-479
31. Special issue on decompositions of first-order logic. Blackburn P., and Seligman J. Hybrid languages. Journal of Logic, Language and Information 4 3 (1995) 251-272
32. Blackburn P., and Seligman J. What are hybrid languages?. In: Kracht M., de Rijke M., Wansing H., and Za- kharyaschev M. (Eds). Advances in Modal Logic 1 (1998), CSLI Publications, Stanford University 41-62
33. Blackburn P., and Spaan E. A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language and Information 2 (1993) 129-169
34. P. Blackburn, B. ten Cate Pure extensions, proof rules, and hybrid axiomatics, 127, Schmidt, 19-29
35. Blackburn P., and Tzakova M. Hybrid completeness. Logic Journal of the IGPL 6 (1998) 625-650
36. Blackburn P., and Tzakova M. Hybridizing concept languages. Annals of Mathematics and Artificial Intelligence 24 (1998) 23-49
37. Blackburn P., and Tzakova M. Hybrid languages and temporal logic. Logic Journal of the IGPL 7 1 (1999) 27-54
38. T. Bolander and T. Braüner. Two tableau-based decision procedures for hybrid logic. In Schlinglof [126].
39. With an appendix by C. Allauzen and B. Durand. Borger E., Grädel E., and Gurevich Y. The Classical Decision Problem (1997), Springer-Verlag, Berlin
40. Borgida A., and Patel-Schneider P. A semantics and complete algorithm for subsumption in the CLASSIC description logic. Journal of Artificial Intelligence Research 1 (1994) 277-308
41. Brachman R., and Schmölze J. An overview of the KL-ONE knowledge representation system. Cognitive Science 9 2 (1985) 171-216
42. Braüner T. Natural deduction for hybrid logic. Journal of Logic and Computation 14 3 (2004) 329-353
43. Braüner T. Two natural deduction systems for hybrid logic: A comparison. Journal of Logic, Language and Infor- mation 13 1 (2004) 1-23
44. Braüner T. Natural deduction for first-order hybrid logic. Journal of Logic, Language and Information 14 2 (2005) 173-198
45. T. Braüner and V. de Paiva. Towards constructive hybrid logic. In Areces and Blackburn [5].
46. Bull R. An approach to tense logic. Theoria 36 (1970) 282-300
47. Buss S. Bounded arithmetic and propositional proof complexity. In: Schwichtenberg H. (Ed). Logic and Computa- tion (1997), Springer-Verlag, Berlin 67-122
48. Stockholm, Sweden. Calvanese D., De Giacomo G., and Lenzerini M. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Dean T. (Ed). Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99) (1999), Morgan-Kaufmann Publishers 84-89
49. Chagrov A., and Zakharyaschev M. Modal logic (1997), Oxford University Press
50. Chen C., and Lin I. The complexity of prepositional modal theories and the complexity of consistency of prepositional modal theories. In: Nerode A., and Matiyasevich Y. (Eds). Proceedings of the Third International Symposium on Logical Foundations of Computer Science. Lecture Notes in Computer Science volume 813 (1994), Springer 69-80
51. Winter. Copeland B., and Prior A. In: Zalta E. (Ed). The Stanford Encyclopedia of Philosophy (1999). http://plato.stanford.edu/archives/winl999/entries/prior
52. Cresswell M. Entities and Indices (1990), Reidel, Dordrecht
53. Cresswell M. Semantic Indexicality (1996), Kluwer, Dordrecht
54. Dabrowski A., Moss L., and Parikh R. Topological reasoning and the logic of knowledge. Annals of Pure and Applied Logic 78 (1996) 73-110
55. De Giacomo G. Decidability of class-based knowledge representation formalisms. PhD thesis (1995), Universitâ di Roma 'La Sapienza
56. De Giacomo G., and Lenzerini M. Boosting the correspondence between description logics and prepositional dy-namic logics. Proceedings of the 12th National Conference on Artificial Intelligence (AAAI'94) (1994) 205-212
57. LNAI. Demri S. Sequent calculi for nominal tense logics: a step towards mechanization?. In: Murray N. (Ed). Conference on Tableaux Calculi and Related Methods (TABLEAUX), Saratoga Springs, USA volume 1617 (1999), Springer Verlag 140-154
58. Enderton H. A mathematical introduction to logic (1972), Academic Press, New York
59. Feferman S. Persistent and invariant formulas for outer extensions. Compositio Mathematica 20 (1968) 29-52
60. Research Announcement. Feferman S., and Kreisel G. Persistent and invariant formulas relative to theories of higher order. Bulletin of the American Mathematical Society 72 (1966) 480-485
61. Fine K. Prepositional quantifiers in modal logic. Theoria 36 (1970) 336-346
62. Fine K. Failures of the interpolation lemma in quantified modal logic. Journal of Symbolic Logic 44 2 (1979) 201-206
63. Fitting M. First order logic and automated theorem proving. 2 edition (1996), Springer Verlag
64. M. Franceschet, M. de Rijke, Model checking for hybrid logics, Areces and Blackburn [5], pages 109-124
65. Caims, Queensland, Australia, July. Franceschet M., de Rijke M., and Schlingloff H. Hybrid logics on linear structures: Expressivity and complexity. Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003) (2003), IEEE complex ity 166-173
66. Gabbay D. Investigations in Modal and Tense Logics with Applications to Problems in Philosophy and Linguistics (1976), Reidel, Dordrecht
67. An irreflexivity lemma. Gabbay D. In: Mönnich U. (Ed). Aspects of Philosophical Logic (1981), Reidel 67-89
68. Oxford Science Publications. Gabbay D. Labelled Deductive Systems Vol. 1 (1996), The Clarendon Press Oxford University Press, New York
69. Studies in Logic. Gabbay D., Kurucz A., Wolter F., and Zakharyaschev M. Many-Dimensional Modal Logics: Theory and Applica- tions volume 148 (2003), North-Holland
70. ILLC MSc thesis series MoL-2001-11. Gabelaia D. Modal definability in topology. Master's thesis (2001), University of Amsterdam
71. Gargov G. Decidability of the basic combinatory prepositional dynamic logic (in Russian). In: Ershov A., and Skordev D. (Eds). Mathematical Theory of Programming (1985), Computer Centre of the Siberian Division of Soviet Academy of Sciences, Novosibirsk 42-49
72. Gargov G., and Goranko V. Modal logic with names. Journal of Philosophical Logic 22 6 (1993) 607-636
73. 259-rsk. Gargov G., and Passy S. Determinism and looping in combinatory PDL. Theoretical Computer Science 61 2-3 (1985)
74. Gargov G., Passy S., and Tinchev T. Modal environment for boolean speculations. In: Scordev D. (Ed). Mathemat- ical Logic and its Applications (1987), Plenum Press, New York 253-263
75. Number 130. Goldblatt R. Axiomatizing the Logic of Computer Programming (1982), LNCS. Springer, Berlin
76. Goldblatt R., and Thomason S. Axiomatic classes in prepositional modal logic. In: Crossley J. (Ed). Algebra andLogic (1974), Springer 163-173
77. of Lecture Notes in ArtificialIntelligence. Goranko V. Temporal logic with reference pointers. Temporal Logic volume 827 (1994), Springer-Verlag 133-148
78. Goranko V. Hierarchies of modal and temporal logics with reference pointers. Journal of Logic, Language andInformation 5 1 (1996) 1-24
79. Goranko V. Computation tree logics and temporal logics with reference pointers. Journal of Applied Non-classicalLogics 10 3-4 (2000) 221-242
80. Goranko V., and Vakarelov D. Sahlqvist formulae in hybrid polyadic modal logics. Journal of Logic and Computation ll 5 (2001) 737-754
81. In: Goré R., Leitsch A., and Nipkow T. (Eds). Proceedings of the 5th Internaltion Joint Conference on AutomatedReasoning (IJCAR'01) number 2083 (2001), Lecture Notes in Artificial Intelligence, Springer-Verlag
82. Grädel E. On the restraining power of guards. Journal of Symbolic Logic 64 4 (1999) 1719-1742
83. V. Haarslev and R. Möller. RACER: Renamed ABox and concept expression reasoner. http://www.sts. tu-harburg.de/~r. f.moeller/racer. Last visited: Dec/05
84. V. Haarslev and R. Möller. RACER system description. In Goré et al. [81], pages 701-705.
85. of Synthese Library. Harel D. Dynamic logic. Extensions of classical logic. In: Gabbay D., and Guenthner F. (Eds). Handbook of Philosophical Logic. Vol. II volume165 (1984), D. Reidel Publishing Co, Dordrecht 497-604
86. of Lecture Notes in Computer Science. Heinemann B. A hybrid logic of knowledge supporting topological reasoning. Berlin. In: Rattray C., Maharaj S., and Shankland C. (Eds). Algebraic Methodology and Software Technology, AMAST 2004 volume 3116 (2004), Springer 181-195
87. Heinemann B. The hybrid logic of linear set spaces. Logic Journal of the IGPL 12 3 (2004) 181-198
88. Henzinger T. Half-order modal logic: how to prove real-time properties. PODC '90: Proceedings of the 9thannual ACM Symposium on Principles of Distributed Computing (1990), ACM Press 281-296
89. I. Horrocks. FaCT: Fast classification of terminologies. http://www.cs.man.ac.uk/~horrocks/FaCT. Last visited: Dec/05.
90. Horrocks I. Using an expressive description logic: FaCT or fiction?. Proceedings of the 6th International Conference on the Principles of Knowledge Representation and Reasoning (KR98) (1998) 636-647
91. Seattle, Washington,USA, August. Horrocks I., and Sattler U. Ontology reasoning in the SHOQ(D) description logic. In: Nebel B. (Ed). Proceedingsof the 17th International Joint Conference on Artificial Intelligence (IJCAI'01) (2001), Morgan-Kaufmann Publishers 199-204
92. Seattle,Edingurgh, UK, August. Horrocks I., and Sattler U. A tableaux decision procedure for SHOIQ. In: Pack Kaelbling L., and Saffiotti A. (Eds). Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01) (2005), Professional Book Center 199-204
93. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. In Areces et al. [13],pages 239-264.
94. Germany. Horrocks I., Sattler U., and Tobies S. Reasoning with individuals for the description logic SHTQ. In: MacAllester D. (Ed). Proceedings of the 17th International Conference on Automated Deduction (CADE-17). Lecture Notes in Computer Science (2000), Springer Verlag 482-496
95. Hussain A. A minimal hybrid logic for intervals. Logic Journal of the IGPL 14 1 (2006) 35-62
96. Kamp H. Formal properties of "now". Theoria 37 (1971) 227-273
97. Konikowska B. A logic for reasoning about relative similarity. Studia Logica 58 (1997) 185-226
98. B. Kooi, G. Renardel de Lavalette, and R. Verbrugge. Strong completeness for non-compact hybrid logics. In Schmidt et al. [127], pages 212-223.
99. Kurtonina N. Frame and Labels. PhD thesis (1994), Utrecht University
100. Kutz O., Lutz C., Wolter F., and Zakharyaschev M. E-connections of abstract description systems. Artificial Intelli-gence 156 1 (2004) 1-73
101. Kutz O., Wolter F., Sturm H., Suzuki N., and Zakharyaschev M. Logics of metric spaces. ACM Transactions onComputational Logic 4 2 (2003) 260-294
102. of Memoirs of the American Mathematical Society. Lévy A. A hierarchy of formulas in set theory volume 57 (1965), American Mathematical Society
103. Lutz C. An improved NExpTime-hardness result for the description logic ALC extended with inverse roles, nom-inals, and counting. LTCS-Report LTCS-04-07 (2004), Chair for Automata Theory, Institute for Theoretical ComputerScience, Dresden University of Technology, Germany
104. MacGregor R. Inside the LOOM description classifier. SIGART Bulletin 2 3 (1991) 88-92
105. Marx M. Narcissists, stepmothers and spies. In: Görz G., Haarslev V., Lutz C., and Möller R. (Eds). Proceedings of the 2002 International Workshop on Description Logics (DL'02) (2002), Toulouse, France
106. of Applied Logic Series. Marx M., and Venema Y. Multidimensional Modal Logic volume 4 (1997), Kluwer Academic Publishers, Dordrecht
107. D. McGuinness and F. van Harmelen. OWL Web Ontology Language. Overview. http://www.w3.org/TR/ owl-features. Last visited: Dec/05.
108. McKinsey J., and Tarski A. The algebra of topology. Annals of Mathematics 45 (1944) 141-191
109. McTaggart J. The unreality of time. Mind (1908) 457-474
110. M. Mundhenk, T. Schneider, T. Schwentick, and V. Weber. Complexity of hybrid logics over transitive frames. In Schlinglof [126].
111. Øhrstrøm P., and Hasle P. A. N. Prior's rediscovery of tense logic. Erkenntnis 39 (1993) 23-50
112. In: Orlowska E. (Ed). Incomplete Information: Rough Set Analysis (1997), Studies in Fuzziness and Soft Computing. Physica-Verlag
113. Passy S., and Tinchev T. PDL with data constants. Information Processing Letters 20 1 (1985) 35-41
114. LNCS. Passy S., and Tinchev T. Quantifiers in combinatory PDL: completeness, definability, incompleteness. Fundamen-tals of Computation Theory FCT85 volume 199 (1985), Springer 512-519
115. Passy S., and Tinchev T. An essay in combinatory dynamic logic. Information and Computation 93 2 (1991) 263-332
116. Prior A. The syntax of time-distinctions. Franciscan Studies 18 (1958) 105-120
117. Prior A. Past, Present and Future (1967), Clarendon Press, Oxford
118. Prior A. Papers on Time and Tense (1968), University of Oxford Press
119. Prior A., Fine K., and Reape M. A feature value logic. Worlds, Times and Selves (1977), Duckworth, London
120. Prior A., Fine K., and Reape M. A feature value logic. In: Rupp C., Rosner M., and Johnson R. (Eds). Constraints, Language andComputation (1994), Academic Press, Synthese Language Library 77-110
121. Reynolds M. An axiomatization of full computation tree logic. Journal of Symbolic Logic 66 3 (2001) 1011-1057
122. Richards B., Bethke I., van der Does J., and Oberlander J. Temporal Representation and Inference (1989), Academic Press, London
123. Rounds W. Feature logics. In: van Benthem J., and ter Meulen A. (Eds). Handbook of Logic and Language (1997), North-Holland Publishing Co, Amsterdam 475-533
124. U. Sattler and M. Vardi. The hybrid μ-calculus. In Goré et al. [81], pages 76-91.
125. Sydney, Australia, August. Schild K. A correspondence theory for terminological logics. Proceedings of the 12th International Joint Con-ference on Artificial Intelligence (IJCAI'91) (1991), Morgan-KaufmannPublishers 466-471
126. In: Schlinglof H. (Ed). Methods for Modalities 4 (2005), Berlin Adlershof, Germany, December
127. In: Schmidt R., Pratt-Hartmann I., Reynolds M., and Wansing H. (Eds). Proceedings of 5th AiML Conference. Manchester, UK (2004), Department of Computer Science, University of Manchester
128. Seligman J. A cut-free sequent calculus for elementary situated reasoning. Technical Report HCRC/RP-22 (1991), HCRC, Edinburgh
129. Seligman J. The logic of correct description. In: de Rijke M. (Ed). Advances in Intensional Logic (1997), Kluwer 107-135
130. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.). Seligman J. Intemalization: The case of hybrid logics. Journal of Logic and Computation ll 5 (2001) 671-689
131. Sellink M. Verifying modal formulae over I/O-automata by means of type theory Logic group preprint series (1994), Utrecht University
132. Simpson A. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis (1994), University of Edinburgh
133. Spaan E. Complexity of Modal Logics. PhD thesis (1993), ILLC, University of Amsterdam
134. Sustretov D. Hybrid definability in topological spaces. In: Gervain J. (Ed). Proceedings of ESSLLI'2005 StudentSession (2005) 342-352
135. ten Cate B. Interpolation for extended modal languages. Journal of Symbolic Logic 70 1 (2005) 223-234
136. University of Amsterdam. ten Cate B. Model theory for extended modal languages. ILLCDissertation Series DS-2005-01. PhD thesis (2005)
137. ten Cate B. Expressivity of second-order propositional modal logic. Journal of Philosophical Logic 35 (2006) 209-223
138. ten Cate B., and Franceschet M. Guarded fragments with constants. Journal of Logic, Language andInformation 14 3 (2005) 281-288
139. ten Cate B., and Franceschet M. On the complexity of hybrid logics with binders. In: Ong L. (Ed). Proceedings of5th AiML Conference, volume 3634 of Lecture Notes in Computer Science (2005), Springer Verlag 339-354
140. ten Cate B., Marx M., and Viana P. Hybrid logics with Sahlqvist axioms. Logic Journal of the IGPL 13 3 (2005) 293-300
141. Tzakova M. Hybrid Languages. PhD thesis (1999), Technischen Fakultät der Universität des Saarlandes
142. of LNAI. Tzakova M. Tableaux calculi for hybrid logics. In: Murray N. (Ed). Proceedings of the Conference on TableauxCalculi and Related Methods (TABLEAUX), Saratoga Springs, USA volume 1617 (1999), SpringerVerlag 278-292
143. Vardi M. Reasoning about the past with two-way automata. In: Larsen K., Skyum S., and Winskel G. (Eds). Proceedings of the 25th International Colloquium on Automata, Languages and Programming. Lecture Notes InComputer Science (1998), Springer-Verlag 628-641
144. Venema Y. Many-dimensional modal logic. PhD thesis (1991), ILLC, University of Amsterdam
145. Viganö L. Labelled Non-Classical Logics (2000), Kluwer Academic Publishers
146. Vlach F. Now and Then: a formal study in the logic of tense anaphora. PhD thesis (1973.), UCLA