Coalgebraic hybrid logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5504 LNCS, Issue , 2009, Pages 137-151

  Myers, Rob ^a   Pattinson, Dirk ^a   Schröder, Lutz ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COALGEBRAIC; FINITE MODEL PROPERTY; GENERIC FRAMEWORKS; HYBRID LOGIC; MODAL LOGIC; MODAL OPERATORS; NEW RESULTS; SEMANTIC CRITERIA;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; COMPUTER SOFTWARE;

PROBABILISTIC LOGICS;

EID: 70350656392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00596-1_11     Document Type: Conference Paper

References (35)

1. Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodŕiguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 307-321. Springer, Heidelberg (1999)
2. Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logics. Elsevier, Amsterdam (2006)
3. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
4. Baader, F., Milicic, M., Lutz, C., Sattler, U., Wolter, F.: Integrating description logics and action formalisms for reasoning about web services. LTCS-Report LTCS-05-02, Dresden University of Technology (2005), http://lat.inf.tu-dresden.de/research/reports.html
5. Bezhanishvili, N., ten Cate, B.: Transfer results for hybrid logic. Part 1: the case without satisfaction operators. J. Logic Comput. 16, 177-197 (2006)
6. Blackburn, P., Marx, M.: Tableaux for quantified hybrid logic. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 38-52. Springer, Heidelberg (2002)
7. Bolander, T., Blackburn, P.: Termination for hybrid tableaus. J. Logic Comput. 17, 517-554 (2007)
8. Bolander, T., Braüner, T.: Tableau-based decision procedures for hybrid logic. J. Log. Comput. 16(6), 737-763 (2006)
9. Book, R., Long, T., Selman, A.: Quantitative relativizations of complexity classes. SIAM J. Computing 13, 461-487 (1984)
10. Braüner, T.: Natural deduction for first-order hybrid logic. J. Logic, Language and Information 14, 173-198 (2005)
11. Calin, G., Myers, R., Pattinson, D., Schröder, L.: CoLoSS: The coalgebraic logic satisfiability solver (system description). In: Methods for Modalities, M4M-5. ENTCS. Elsevier, Amsterdam (to appear, 2008)
12. ten Cate, B.: Model theory for extended modal languages. PhD thesis, University of Amsterdam, ILLC Dissertation Series DS-2005-01 (2005)
13. Chandra, A., Stockmeyer, L.: Alternation. J. ACM 28, 114-133 (1981)
14. Chellas, B.: Modal Logic. Cambridge University Press, Cambridge (1980)
15. D'Agostino, G.,Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic 41, 267-298 (2002)
16. Demri, S., Lugiez, D.: Presburger modal logic is PSPACE-complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 541-556. Springer, Heidelberg (2006)
17. Fagin, R., Halpern, J.Y.: Reasoning about knowledge and probability. J. ACM 41, 340-367 (1994)
18. Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic 13, 516-520 (1972)
19. Haarslev, V., Möller, R., van der Straeten, R.,Wessel, M.: Extended query facilities for racer and an application to software-engineering problems. In: Description Logics, DL 2004, pp. 148-157 (2004)
20. Heifetz, A., Mongin, P.: Probabilistic logic for type spaces. Games and Economic Behavior 35, 31-53 (2001)
21. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inform. Comput. 94, 1-28 (1991)
22. Mares, E.: Relevant Logic: A Philosophical Interpretation. Cambridge University Press, Cambridge (2004)
23. Papadimitriou, C.: On the complexity of integer programming. J. ACM 28, 765-768 (1981)
24. Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci. 309, 177-193 (2003)
25. Pattinson, D., Schröder, L.: Admissibility of cut in coalgebraic logics. In: Coalgebraic Methods in Computer Science, CMCS 2008. ENTCS, vol. 203, pp. 221-241. Elsevier, Amsterdam (2008)
26. Pauly, M.: A modal logic for coalitional power in games. J. Logic Comput. 12, 149-166 (2002)
27. Schröder, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog. 73, 97-110 (2007)
28. Schröder, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, LICS 2006, pp. 231-240. IEEE, Los Alamitos (2006); Full version to appear in ACM TOCL
29. Schröder, L., Pattinson, D.: Shallow models for non-iterative modal logics. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 324-331. Springer, Heidelberg (2008)
30. Seligman, J.: Internalization: The case of hybrid logics. J. Logic Comput. 11, 671-689 (2001)
31. Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. J. Web Semantics (2006)
32. Troelstra, A., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)
33. Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: System description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 292-297. Springer, Heidelberg (2006)
34. Tzakova, M.: Tableau calculi for hybrid logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS, vol. 1617, pp. 278-292. Springer, Heidelberg (1999)
35. Zolin, E.: The description logic complexity navigator (2007), http://www.cs.man.ac.uk/̃ezolin/dl