Undecidability of compass logic

Journal of Logic and Computation

Volumn 9, Issue 6, 1999, Pages 897-914

  Marx, Maarten ^a   Reynolds, Mark ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b MURDOCH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; DECISION THEORY; FINITE AUTOMATA; SET THEORY; THEOREM PROVING;

DECISION PROBLEMS; TEMPORAL LOGIC; TILING; TWO DIMENSIONAL MODAL LOGIC;

FORMAL LOGIC;

EID: 0033347679     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.6.897     Document Type: Article

References (36)

1. J. Allen, H. Kautz, R. Pelavin and J. Tenenberg. Reasoning about Plans. Morgan Kaufman, 1991.
2. L. Åqvist. A conjectured axiomatization of two-dimensional Reichenbachian tense logic. Journal of Philosophical Logic, 8, 1-45, 1979.
3. N. Belnap and M. Perloff. Seeing to it that: a canonical form of agentives. In Knowledge representation and defeasible reasonings, H. Kyburg, R. Loui and G. Carlson, eds. pp. 175-199. Kluwer, Dordrecht, 1990.
4. B. Bennett. Modal logics for qualitative spatial reasoning. Journal of the Interest Group in Pure and Applied Logic (IGPL), 4, 21-44, 1996.
5. R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematic Society, 66, 1966.
6. M. Di Maio and A. Zanardo. Synchronized histories in prior-thomason representation of branching time. In Temporal Logic, Proceedings of ICTL '94, No 827 in LNAI, D. Gabbay and H. Ohlbach, eds.pp. 265-282. Springer-Verlag, 1994.
7. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. The MIT Press, 1995.
8. M. Finger and D. M. Gabbay. Adding a temporal dimension to a logic system. Journal of Logic Language and Information, 1, 203-233, 1992.
9. M. Finger and D. Gabbay. Combining temporal logic systems. Notre Dame Journal of Formal Logic, 37, 204-232, 1996. Special Issue on Combining Logics.
10. M. Finger and M. Reynolds. Two-dimensional executable temporal logic for bitemporal databases. In International Conference on Temporal Logic, ICTL'97. Kluwer, 1999.
11. M. Finger. Handling database updates in two-dimensional temporal logic. Journal of Applied Non-Classical Logic, 2, 201-224, 1992.
12. D. Gabbay and V. Shehtman. Products of modal logics, part 1. Logic Journal of the IGPL, 6, 73-146, 1998.
13. D. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1. Oxford University Press, 1994.
14. J. Halpern and Y. Shoham. A prepositional modal logic of time intervals. In Proceedings, Symposium on Logic in Computer Science. IEEE, Boston, 1986.
15. J. Halpern and M. Vardi. The complexity of reasoning about knowledge and time. I. Lower bounds. Journal of Computer and System Science, 38, 195-237, 1989.
16. D. Harel. Recurring dominoes: Making the highly undecidable highly understandable. In Conference on Foundations of Computing Theory, pp. 177-194. Springer, Berlin, 1983. Lecture Notes in Computer Science 158.
17. D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. Journal of the ACM., 33, 224-248, 1986.
18. R. Ladner and J. Reif. The logic of distributed protocols. In Theoretical Aspects of Reasoning about Knowledge (Proc. 1986 Conference). J. Halpern, ed. Kaufman, 1986.
19. M. Marx and Y. Venema. Multi-Dimensional Modal Logic. Kluwer, 1997.
20. M. Marx. Complexity of modal logics of relations. Technical Report ML-97-02, ILLC, University of Amsterdam, May 1997.
21. M. Marx. Complexity of products of modal logics. Journal of Logic and Computation, 9, 221-238, 1999.
22. J. Reif and A. Sistla. A multiprocess network logic with temporal and spatial modalities. Journal of Computer and System Sciences, 30, 41-53, 1985.
23. M. Reynolds. A decidable temporal logic of parallelism. Notre Dame Journal of Formal Logic, 38, 3):419-436, Summer 1997.
24. R. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Math, 12, 177-209, 1971.
25. G. Sambin and V. Vaccaro. A new proof of Sahlqvist's theorem on modal definability and completeness. Journal of Symbolic Logic, 54, 992-999, 1989.
26. K. Segerberg. Two-dimensional modal logic. J. Philosophical Logic, 2, 77-96, 1973.
27. R. Snodgrass and I. Ahn. A Taxonomy of Time in Databases. In ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 1985. S. Navathe, ed. pp. 236-246, Association for Computer Machinery.
28. E. Spaan. Nexttime is not necessary. In Proceedings of the Third Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 241-256. Morgan Kaufman, 1990.
29. E. Spaan. Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.
30. S. Thomason. Independent prepositional modal logics. Studia Logica, 39, 143-144, 1980.
31. J. van Benthem. Correspondence theory. In Handbook of Philosophical Logic, D. M. Gabbay and F. Guenthner, eds. pp. 167-247. D. Reidel, 1984.
32. J. van Benthem. Temporal logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 4. D. Gabbay, ed. Oxford University Press, 1995.
33. Y. Venema and M. Marx. A modal logic of relations. In Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa. E. Orlowska, ed. Springer-Verlag, 1998.
34. Y. Venema. Expressiveness and completeness of an interval tense logic. Notre Dame Journal of Formal Logic, 31, 529-547, 1990.
35. F. von Kutschera. Causation. Journal of Philosophical Logic, 563-588, 1993.
36. A. Zanardo. Branching-time logic with quantification over branches: the point of view of modal logic. Journal of Symbolic Logic, 61, 1-39, 1996.