Non-finite axiomatizability and undecidability of interval temporal logics with C, D, and T

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

Volumn 5213 LNCS, Issue , 2008, Pages 308-322

  Hodkinson, Ian ^a   Montanari, Angelo ^b   Sciavicco, Guido ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF MURCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CRYSTAL LATTICES; TECHNICAL PRESENTATIONS;

BINARY OPERATORS; FINITE AXIOMATIZABILITY; INTERVAL LOGICS; INTERVAL TEMPORAL LOGICS; POTENTIAL APPLICATIONS; STANDARD RULES; UNARY OPERATORS; UNDECIDABILITY; UNDECIDABILITY RESULTS;

COMPUTABILITY AND DECIDABILITY;

EID: 57849150015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-423     Document Type: Conference Paper

References (25)

1. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)
2. Borger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Perspectives of Mathematical Logic. Springer, Heidelberg (1997)
3. Bowman, H., Thompson, S.: A decision procedure and complete axiomatization of finite interval temporal logic with projection. Journal of Logic and Computation 13(2), 195-239 (2003)
4. Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau-based Decision Procedure for the Logic of Proper Subinterval Structures over Dense Orderings. In: Areces, C., Demri, S. (eds.) Proceedings of M4M-5: 5th International Workshop on Methods for Modalities, pp. 335-351 (2007)
5. Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau Systems for Logics of Subinterval Structures over Dense Orderings. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 73-89. Springer, Heidelberg (2007)
6. Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 84-99. Springer, Heidelberg (2007)
7. Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions. Technical Report 05, Department of Mathematics and Computer Science, University of Udine, Italy (2008)
8. Bresolin, D., Montanari, A., Sala, P.: An optimal tableau-based decision algorithm for Propositional Neighborhood Logic. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 549-560. Springer, Heidelberg (2007)
9. Bresolin, D., Montanari, A., Sciavicco, G.: An optimal decision procedure for Right Propositional Neighborhood Logic. Journal of Automated Reasoning 38(1-3), 173-199 (2007)
10. Chang, C.C., Keisler, H.J.: Model theory. North-Holland, Amsterdam (1990)
11. Gabbay, D.M.: An irreflexivity lemma with applications to axiomatizations of conditions on tense frames. In: Monnich, U. (ed.) Aspects of Philosophical Logic, pp. 67-89. Reidel, Dordrecht (1981)
12. Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood temporal logics. Journal of Universal Computer Science 9(9), 1137-1167 (2003)
13. Goranko, V., Montanari, A., Sciavicco, G.: A road map of interval temporal logics and duration calculi. J. of Applied Non-Classical Logics 14(1-2), 9-54 (2004)
14. Goranko, V., Montanari, A., Sciavicco, G., Sala, P.: A general tableau method for propositional interval temporal logics: Theory and implementation. Journal of Applied Logic 4(3), 305-330 (2006)
15. Greenwood, R.E., Gleason, A.M.: Combinatorial relations and chromatic graphs. Canadian Journal of Mathematics 7, 1-7 (1955)
16. Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935-962 (1991)
17. Hirsch, R., Hodkinson, I.: Relation algebras by games. Studies in Logic and the Foundations of Mathematics, vol. 147. North-Holland, Amsterdam (2002)
18. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
19. Lodaya, K.: Sharpening the undecidability of interval temporal logic. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 290-298. Springer, Heidelberg (2000)
20. Maddux, R.: Relation algebras. Studies in Logic and the Foundations of Mathematics, vol. 150. Elsevier, Amsterdam (2006)
21. Monk, J.D.: Nonfinitizability of classes of representable cylindric algebras. Journal of Symbolic Logic 34, 331-343 (1969)
22. Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)
23. Roy, S., Sciavicco, G.: Completeness of chop. In: Guesguen, H.W., Ligozat, G., Rodriguez, R. V. (eds.) Proc. of the IJCAI 2007 Workshop on Spatial and Temporal Reasoning, pp. 90-95 (2007)
24. Venema, Y.: Expressiveness and completeness of an interval tense logic. Notre Dame Journal of Formal Logic 31(4), 529-547 (1990)
25. Venema, Y.: A modal logic for chopping intervals. Journal of Logic and Computation 1(4), 453-476 (1991)