Tableaux for logics of subinterval structures over dense orderings

Journal of Logic and Computation

Volumn 20, Issue 1, 2010, Pages 133-166

  Bresolin, Davide ^a   Goranko, Valentin ^b   Montanari, Angelo ^c   Sala, Pietro ^c  

^a UNIVERSITY OF VERONA   (Italy)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FORMAL LOGIC;

DECISION PROCEDURE; LINEAR ORDERINGS; PSEUDO-MODELS; PSPACE COMPLETENESS; SPECIAL TREATMENTS; SUB-INTERVAL; SUBINTERVALS; THEOREM PROVERS;

LOGIC PROGRAMMING;

EID: 76649135787     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exn063     Document Type: Article

References (22)

1. A. A. Aaby and K. T. Narayana. Propositional temporal interval logic is PSPACE complete. In Proceedings of 9th International Conference Automated Deduction. Vol.193 of Lecture Notes in Computer Science, pp. 218-237. Springer, 1985.
2. H. Bowman and S. Thompson. A tableau method for Interval Temporal Logic with projection. In Proceedings of TABLEAUX 1998. Vol.1397 of Lecture Notes in Artificial Intelligence, pp. 108-134. Springer, 1998.
3. H. Bowman and S. Thompson. A decision procedure and complete axiomatization of finite interval temporal logic with projection. Journal of Logic and Computation, 13, 195-239, 2003.
4. D. Bresolin, V. Goranko, A. Montanari and P. Sala. Tableau-based decision procedure for the logic of proper subinterval structures over dense orderings. In Proceedings of the 5th International Workshop on Methods for Modalities (M4M), C. Areces and S. Demri, eds, pp. 335-351, Ecole Normale Superieure, 2007.
5. D. Bresolin, V. Goranko, A. Montanari and P. Sala. Tableau systems for logics of subinterval structures over dense orderings. In Proceedings of TABLEAUX 2007, N. Olivetti, ed., Vol.4548 of Lecture Notes in Artificial Intelligence, pp. 73-89. Springer, 2007.
6. D. Bresolin, V. Goranko, A. Montanari and G. Sciavicco. On decidability and expressiveness of propositional interval neighborhood logics. In Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS). Vol.4514 of Lecture Notes in Computer Science, pp. 84-99. Springer, 2007.
7. D. Bresolin and A. Montanari.Atableau-based decision procedure for a branching-time interval temporal logic. In Proceedings of the 4th International Workshop on Methods for Modalities (M4M), H. Schlingloff, ed., pp. 38-53, Humboldt-Universitaet, 2005.
8. D. Bresolin and A. Montanari. A tableau-based decision procedure for Right Propositional Neighborhood Logic. In Proceedings of TABLEAUX 2005, B. Beckert, ed.,Vol. 3702 of Lecture Notes in Artificial Intelligence, pp. 63-77. Springer, 2005.
9. D. Bresolin, A. Montanari and P. Sala. An optimal tableau-based decision algorithm for Propositional Neighborhood Logic. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS). Vol.4393 of Lecture Notes in Computer Science, pp. 549-560. Springer, 2007.
10. D. Bresolin, A. Montanari and G. Sciavicco. An optimal decision procedure for Right Propositional Neighborhood Logic. Journal of Automated Reasoning, 38, 173-199, 2007.
11. M. Castilho, L. Fariñas del Cerro, O. Gasquet and A. Herzig. Modal tableaux with propagation rules and structural rules. Fundamenta Informaticae, 32, 281-297, 1997.
12. Z. Chaochen, M. R. Hansen and P. Sestoft. Decidability and undecidability results for duration calculus. In Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science. Vol.665 of Lecture Notes in Computer Science, pp. 58-68. Springer, 1993.
13. L. K. Dillon, G. Kutty, L. E. Moser, P. M. Melliar-Smith and Y. S. Ramakrishna. A real-time interval logic and its decision procedure. In Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science. Vol.761 of Lecture Notes in Computer Science, pp. 173-192. Springer, 1993.
14. L. K. Dillon, P. M. Melliar-Smith, L. E. Moser, G. Kutty and Y. S. Ramakrishna. Interval logics and their decision procedures. Part I: an interval logic. Theoretical Computer Science, 166, 1-47, 1996. (Pubitemid 126412021)
15. L. Fariñas del Cerro, D. Fauthoux, O. Gasquet, A. Herzig, D. Longin and F. Massacci. Lotrec: the generic tableau prover for modal and description logics. In International Joint Conference on Automated Reasoning, Lecture Notes in Computer Science, vol.2083, pp. 6. Springer, 2001.
16. J.Y. Halpern andY. Shoham.Apropositional modal logic of time intervals. Journal of the ACM, 38, 935-962, 1991.
17. K. Lodaya. Sharpening the undecidability of interval temporal logic. In Proceedings of 6th Asian Computing Science Conference.Vol. 1961 of Lecture Notes in Computer Science, pp. 290-298. Springer, 2000.
18. A. Montanari, G. Sciavicco and N. Vitacolonna. Decidability of interval temporal logics over split-frames via granularity. In Proceedings the 8th European Conference on Logic in Artificial Intelligence (JELIA). Vol.2424 of Lecture Notes in Aritificial Intelligence, pp. 259-270. Springer, 2002.
19. I. Shapirovsky. On PSPACE-decidability in Transitive Modal Logic. In Advances in Modal Logic, R. Schmidt, I. Pratt-Hartmann, M. Reynolds and H.Wansing, eds, Vol.5, pp. 269-287. King's College Publications, London, 2005.
20. I. Shapirovsky and V. Shehtman. Chronological future modality in Minkowski spacetime. In Advances in Modal Logic, P. Balbiani, N. Y. Suzuki, F. Wolter and M. Zakharyaschev, eds, Vol.4, pp. 437-459. King's College Publications, London, 2003.
21. J. van Benthem. The Logic of Time: A Model-Theoretic Investigation into the Varieties of Temporal Ontology and Temporal Discourse, 2nd edn. Kluver, 1991.
22. D.Van Hung and D. P. Guelev. Completeness and decidability of a fragment of duration calculus with iteration. In Advances in Computing Science. P. S. Thiagarajan and R. Yap, eds, Vol.1742 of Lecture Notes in Computer Science, pp. 139-150. Springer, 1999.