What's decidable about Halpern and Shoham's interval logic? The maximal fragment ABB̄L̄

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 387-396

  Bresolin, Davide ^a   Montanari, Angelo ^b   Sala, Pietro ^a   Sciavicco, Guido ^c,d  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF MURCIA   (Spain)

^d University for Information Science and Technology   (Macedonia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE CLASSIFICATION; INTERVAL LOGIC; LINEAR ORDER; MODAL LOGIC; NATURAL SEMANTICS; TEMPORAL STRUCTURES; UNDECIDABILITY;

COMPUTATION THEORY; HYDRAULIC STRUCTURES; SEMANTICS; TEMPORAL LOGIC;

COMPUTABILITY AND DECIDABILITY;

EID: 80052156268     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.35     Document Type: Conference Paper

References (17)

1. J. Halpern and Y. Shoham, "A propositional modal logic of time intervals (short version)," in Proc. of the 1st Symposium on Logic in Computer Science (LICS). IEEE Comp. Society, 1986, pp. 279-292. (Pubitemid 17563575)
2. J. Allen, "Maintaining knowledge about temporal intervals," Communications of the Association for Computing Machinery, vol. 26, no. 11, pp. 832-843, 1983.
3. K. Lodaya, "Sharpening the undecidability of interval temporal logic," in Proc. of the 6th Asian Computing Science Conference on Advances in Computing Science, ser. LNCS, vol. 1961, 2000, pp. 290-298. (Pubitemid 33214024)
4. V. Goranko, A. Montanari, and G. Sciavicco, "A road map of interval temporal logics and duration calculi," Applied Non-classical Logics, vol. 14, no. 1-2, pp. 9-54, 2004.
5. D. Bresolin, D. Della Monica, V. Goranko, A. Montanari, and G. Sciavicco, "Decidable and undecidable fragments of Halpern and Shoham's interval temporal logic: towards a complete classification," in Proc. of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), ser. LNCS, vol. 5330, 2008, pp. 590-604.
6. -, "Undecidability of interval temporal logics with the overlap modality," in Proc. of the 16th International Symposium on Temporal Representation and Reasoning (TIME). IEEE Comp. Society, 2009, pp. 88-95.
7. E. Kieronski, J. Marcinkowski, and J. Michaliszyn, "B and D are enough to make the Halpern-Shoham logic undecidable," in Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP) - Part II, ser. LNCS, vol. 6199, 2010, pp. 357-368.
8. A. Montanari, G. Puppis, and P. Sala, "A decidable spatial logic with cone-shaped cardinal directions," in Proc. of the 18th EACSL Annual Conference on Computer Science Logic (CSL), ser. LNCS, vol. 5771, 2009, pp. 394-408.
9. D. Bresolin, V. Goranko, A. Montanari, and G. Sciavicco, "Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions," Annals of Pure and Applied Logic, vol. 161, no. 3, pp. 289-304, 2009.
10. D. Bresolin, A. Montanari, and G. Sciavicco, "An optimal decision procedure for Right Propositional Neighborhood Logic," Journal of Automated Reasoning, vol. 38, no. 1-3, pp. 173-199, 2007. (Pubitemid 46362156)
11. A. Montanari, G. Puppis, P. Sala, and G. Sciavicco, "Decidability of the interval temporal logic ABB on natural numbers," in Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), 2010, pp. 597-608.
12. A. Montanari, G. Puppis, and P. Sala, "A decidable spatial logic with cone-shape cardinal directions (extended version of [8])," Dipartimento di Matematica ed Informatica, Università di Udine, Research Report 3, 2010.
13. -, "Maximal decidable fragments of Halpern and Shoham's modal logic of intervals," in Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP) - Part II, ser. LNCS, vol. 6199, 2010, pp. 345-356.
14. D. Bresolin, P. Sala, and G. Sciavicco, "Begin, After, and Later: a maximal decidable Interval Temporal Logic," in Proc. of the 1st Symposium on Games, Automata, Logic, and Formal Verification (GandALF), ser. EPTCS, vol. 25, 2010, pp. 72-88.
15. C. Zhou and M. R. Hansen, Duration Calculus: A Formal Approach to Real-Time Systems, ser. EATCS: Monographs in Theoretical Computer Science. Springer, 2004.
16. Y. Venema, "Expressiveness and completeness of an interval tense logic," Notre Dame Journal of Formal Logic, vol. 31, no. 4, pp. 529-547, 1990.
17. S. Safra, "On the complexity of ω-automata," in Proc. of the 29th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Comp. Society, 1988, pp. 319-327.