Carlos Areces, Patrick Blackburn, Maarten Marx  Home/Search
Context Related
| turing.wins.uva.nl/~car...csl99_22.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: turing.wins.uva.nl/~carl...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they internalize the apparatus of labeled deduction. Moreover, they arise naturally in a variety of applications, including description logic and temporal reasoning. Thus it would be useful to have a map of their complexity-theoretic properties, and this paper provides one. Our work falls into two parts. ... (Update)
Cited by: More
Complexity of Hybrid Logics over Transitive Frames - Mundhenk, Schneider.. (Correct)
On the freeze quantifier in constraint LTL: decidability.. - Demri, Lazic, Nowak (2005) (Correct)
A Description Logic Based Approach to Reasoning about - Web Services Franz (2005) (Correct)
Similar documents (at the sentence level):
66.2%: A Road-map on Complexity for Hybrid Logics - Areces, Blackburn, Marx (1999) (Correct)
8.8%: Logic Programming: The Case of Description and Hybrid Logic - Areces (Correct)
8.1%: Hybrid Logics: Characterization, Interpolation and Complexity - Areces, Blackburn, Marx (Correct)
Active bibliography (related documents): More All
0.8: The Computational Complexity of Hybrid Temporal Logics - BLACKBURN, al. (2000) (Correct)
0.7: Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000) (Correct)
0.4: Hybrid Languages and Temporal Logic - Blackburn, Tzakova (Correct)
Similar documents based on text: More All
0.5: HyLoRes: A Hybrid Logic Prover Based on Direct Resolution - Areces, Heguiabehere (2002) (Correct)
0.5: Repairing the Interpolation Theorem in Quantified Modal Logic - Areces, Blackburn, Marx (2003) (Correct)
0.3: Situation Calculus as Hybrid Logic: First Steps - Blackburn, Kamps, Marx (2001) (Correct)
Related documents from co-citation: More All
11: Hierarchies of Modal and Temporal Logics with Reference Pointers - Goranko - 1995
10: What are hybrid languages - Blackburn, Seligman - 1998
9: Language and Information (context) - Blackburn, Seligman et al. - 1995
BibTeX entry: (Update)
Areces, C., Blackburn, P., & Marx, M. (1999). A road-map on complexity for hybrid logics. In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL-99), LNCS 1683, pp. 307-321. Springer-Verlag. http://citeseer.ist.psu.edu/article/areces99roadmap.html More
@inproceedings{ areces99roadmap,
author = "Carlos Areces and Patrick Blackburn and Maarten Marx",
title = "A Road-Map on Complexity for Hybrid Logics",
booktitle = "{CSL}",
pages = "307-321",
year = "1999",
url = "citeseer.ist.psu.edu/article/areces99roadmap.html" }
Citations (may not include all citations):444 Towards a general theory of action and time (context) - Allen - 1984
240 A guide to completeness and complexity for modal logics of k.. (context) - Halpern, Moses - 1992
207 Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991
130 The computational complexity of provability in systems of mo.. (context) - Ladner - 1977
70 The Classical Decision Problem (context) - Borger, Gradel et al. - 1997
65 Modal Logic and Classical Logic (context) - van Benthem - 1983
54 Complexity of modal logics (context) - Spaan - 1993
38 Hierarchies of modal and temporal logics with reference poin.. - Goranko - 1996
35 The logic of time (context) - van Benthem - 1983
33 An approach to tense logic (context) - Bull - 1970
32 What are hybrid languages - Blackburn, Seligman - 1998
26 Hybrid languages and temporal logics - Blackburn, Tzakova - 1999
24 the restraining power of guards - Gradel - 1997
21 The logic of correct description - Seligman - 1997
19 A correspondence theory for terminological logics (context) - Schild - 1991
17 Domino-tiling games (context) - Chlebus - 1986
11 Internalizing labeled deduction (context) - Blackburn - 1998
11 Tableaux calculi for hybrid logics (context) - Tzakova - 1998
9 Labeled deductive systems (context) - Gabbay - 1996
8 La Sapienza (context) - Schaerf, in et al. - 1994
7 Quantifiers in combinatory PDL: completeness (context) - Passy, Tinchev - 1985
6 Accounting for assertional information (context) - Areces, de Rijke - 1999
5 Special issue on decompositions of firstorder logic (context) - Blackburn, Seligman et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://turing.wins.uva.nl/~carlos/hybrid/papers.html): More
Situated Consequence in Elementary Situation Theory - Seligman (1994) (Correct)
Hybrid Logics: Characterization, Interpolation and Complexity - Areces, Blackburn, Marx (Correct)
Hybrid Languages - Blackburn, Seligman (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC