Extending topological nexttime logic

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2000-January, Issue , 2000, Pages 87-94

  Heinemann, Bernhard ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

COMPLEXITY BOUNDS; DIVERSE FIELDS; LINEAR TIME; SATISFIABILITY PROBLEMS; TEMPORAL REASONING;

TEMPORAL LOGIC;

EID: 84949970007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2000.856589     Document Type: Conference Paper

References (16)

1. B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, Cambridge, 1980.
2. A. Dabrowski, L. S. Moss, and R. Parikh. Topol ogical Reasoning and The Logic of Knowledge. Annals of Pure and Applied Logic, 78: 73-110, 1996.
3. J. Davoren. Modal Logics for Continuous Dynamics. PhD dissertation, Department of Mathematics, Cornell University, 1998.
4. C. Dixon andM. Fisher. Tableaux for Synchronous Systems ofKnowledge and Time with Interactions. In G.Grahne (ed.) SCAI'97-Sixth Scandinavian Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, Vol. 40:28-39, IOS Press, Amsterdam, August 1997.
5. R. Fagin,J. Y. Halpern,Y. Moses,M. Y. Vardi. Reasoning about Knowledge. MIT Press Cambridge (Mass.) 1995.
6. K. Georgatos. Knowledge on Treelike Spaces. Studia Logica, 59(2): 271-301, 1997.
7. R. Goldblatt. Logics of Time and Computation. Center for the Study of Language and Information, Stanford, CA, 1987.
8. J. Y. Halpern and Y. Moses. Knowledge and Common Knowledge in a Distri buted Environment. Journal of the ACM, 37(3):549-587, 1990.
9. M. R. Hansen and Z. Chaochen. Duration Calculus: Logical Foundations. Formal Aspects of Computing, 9:283-330, 1997.
10. B. Heinemann. Topological nexttime logic. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev (eds.) Advances in Modal Logic, Vol. 1:99-113, CSLI Publications 87, Stanford, CA, 1998.
11. B. Heinemann. Temporal Aspects of the Modal Logic of Subset Spaces. Theoretical Computer Science, 224(1- 2):135-155, 1999.
12. B. Heinemann. On Sets Growing Continuously . In C. Pandu Rangan, V. Raman, and R. Ramanujam (eds.) Fundamentals of Software Technology& Theoretical Computer Science (19th Conference, FST&TCS'99). Lecture Notes in Computer Science, Vol. 1738:420-431, Springer, Berlin, December 1999.
13. R. E. Ladner. The Computational Complexity of Provability in Systems of Modal Propositional Logic. SIAM Journal of Computing, 6(3):467-480, 1977.
14. J. C. C. McKinsey. A Solution to the Decision Problem for the Lewis Systems S2 and S4, with an Application to Topology. Journal of Symbolic Logic, 6(3):117-141, 1941.
15. W. Nutt. On the Translati on of Qualitative Spatial Reasoning Problems into Modal Logics. Lecture Notes in Artificial Intelligence, Vol. 1701:113-125, Springer, Berlin, 1999.
16. H. Ono and A. Nakamura. On the Size of Refut ation Kripke Models for Some Linear Modal and Tense Logics. Studia Logica 39(4):325-333, 1980.