A Hybrid Logic of Knowledge Supporting Topological Reasoning

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

Volumn 3116, Issue , 2004, Pages 181-195

  Heinemann, Bernhard ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Completeness; Decidability; Hybridization; Logical frameworks for reasoning; Reasoning about knowledge and topology

Indexed keywords

COMPUTABILITY AND DECIDABILITY; RECONFIGURABLE HARDWARE; SEMANTICS; SOFTWARE ENGINEERING; TOPOLOGY;

AXIOMATIZATION; COMPLETENESS; HYBRID LOGIC; HYBRIDIZATION; LOGICAL FRAMEWORKS; REASONING ABOUT KNOWLEDGE; TOPOLOGICAL REASONING;

COMPUTER CIRCUITS;

EID: 26844444634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_17     Document Type: Article

References (22)

1. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge, MA (1995)
2. Meyer, J.J.C., van der Hoek, W.: Epistemic Logic for AI and Computer Science. Volume 41 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1995)
3. Moss, L.S., Parikh, R.: Topological reasoning and the logic of knowledge. In Moses, Y., ed.: Theoretical Aspects of Reasoning about Knowledge (TARK 1992), San Francisco, CA, Morgan Kaufmann (1992) 95-105
4. Dabrowski, A., Moss, L.S., Parikh, R.: Topological reasoning and the logic of knowledge. Annals of Pure and Applied Logic 78 (1996) 73-110
5. Blackburn, P.: Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic Journal of the IGPL 8 (2000) 339-365
6. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001)
7. Areces, C., Blackburn, P., Marx, M.: The computational complexity of hybrid temporal logics. Logic Journal of the IGPL 8 (2000) 653-679
8. Heinemann, B.: Knowledge over dense flows of time (from a hybrid point of view). In Agrawal, M., Seth, A., eds.: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. Volume 2556 of Lecture Notes in Computer Science., Berlin, Springer (2002) 194-205
9. Heinemann, B.: Separating sets by modal formulas. In Haeberer, A.M., ed.: Algebraic Methodology and Software Technology, AMAST'98. Volume 1548 of Lecture Notes in Computer Science., Springer (1999) 140-153
10. Heinemann, B.: Generalizing the modal and temporal logic of linear time. In Rus, T., ed.: Algebraic Methodology and Software Technology, AMAST 2000. Volume 1816 of Lecture Notes in Computer Science., Berlin, Springer (2000) 41-56
11. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
12. Bourbaki, N.: General Topology, Part 1. Hermann, Paris (1966)
13. Heinemann, B.: Extended canonicity of certain topological properties of set spaces. In Vardi, M., Voronkov, A., eds.: Logic for Programming, Artificial Intelligence, and Reasoning. Volume 2850 of Lecture Notes in Artificial Intelligence., Berlin, Springer (2003) 135-149
14. Krommes, G.: A new proof of decidability for the modal logic of subset spaces. In ten Cate, B., ed.: Proceedings of the Eighth ESSLLI Student Session, Vienna, Austria (2003) 137-147
15. Blackburn, P., Spaan, E.: A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language and Information 2 (1993) 129-169
16. Georgatos, K.: Knowledge theoretic properties of topological spaces. In Masuch, M., Polos, L., eds.: Knowledge Representation and Uncertainty, Logic at Work. Volume 808 of Lecture Notes in Artificial Intelligence., Springer (1994) 147-159
17. Georgatos, K.: Knowledge on treelike spaces. Studia Logica 59 (1997) 271-301
18. Heinemann, B.: A hybrid treatment of evolutionary sets. In Coello, C.A.C., de Albornoz, A., Sucar, L.E., Battistutti, O.C., eds.: MICAI'2002: Advances in Artifi-cial Intelligence. Volume 2313 of Lecture Notes in Artificial Intelligence., Berlin, Springer (2002) 204-213
19. Heinemann, B.: An application of monodic first-order temporal logic to reasoning about knowledge. In Reynolds, M., Sattar, A., eds.: TIME-ICTL 2003, Proceedings, Los Alamitos, Ca., IEEE Computer Society Press (2003) 10-16
20. McKinsey, J.C.C.: A solution to the decision problem for the Lewis systems S2 and S4, with an application to topology. Journal of Symbolic Logic 6 (1941) 117-141
21. Gabelaia, D.: Modal definability in topology. Master's thesis, ILLC, Universiteit van Amsterdam (2001)
22. Weiss, M.A., Parikh, R.: Completeness of certain bimodal logics for subset spaces. Studia Logica 71 (2002) 1-30