Hybrid metric propositional neighborhood logics with interval length binders

Electronic Notes in Theoretical Computer Science

Volumn 273, Issue 1, 2011, Pages 3-19

  Della Monica, Dario ^a,b   Goranko, Valentin ^c   Sciavicco, Guido ^d,e  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^d UNIVERSITY OF MURCIA   (Spain)

^e University for Information Science and Technology   (Macedonia)

Author keywords

hybrid logics; interval length binders; interval neighbourhood logics; tiling; undecidability

Indexed keywords

HYBRID LOGIC; INTERVAL LENGTH BINDERS; NEIGHBOURHOOD; TILING; UNDECIDABILITY;

BINDERS; ENGINEERING EXHIBITIONS; MACHINERY;

COMPUTABILITY AND DECIDABILITY;

EID: 79960138711     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2011.06.009     Document Type: Article

References (23)

1. J.F. Allen Maintaining knowledge about temporal intervals Communications of the ACM 26 1983 832 843
2. T. Bolander, J. Hansen, and M.R. Hansen Decidability of a hybrid duration calculus Electronic Notes in Theoretical Computer Science 174 2007 113 133 (Pubitemid 46823926)
3. D. Bresolin, D. Della Monica, V. Goranko, A. Montanari, and G. Sciavicco Decidable and Undecidable Fragments of Halpern and Shohams Interval Temporal Logic: Towards a Complete Classification Proc. of 15th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning LNCS vol. 5330 2008 590 604
4. Bresolin, D., D. Della Monica, V. Goranko, A. Montanari and G. Sciavicco, Metric propositional neighborhood logic: Expressiveness, decidability, and undecidability, in: Proc. of the 19th European Conference on Artificial Intelligence (ECAI 2010), 2010, pp. 695-700.
5. D. Bresolin, V. Goranko, A. Montanari, and G. Sciavicco On Decidability and Expressiveness of Propositional Interval Neighborhood Logics Proc. of the International Symposium on Logical Foundations of Computer Science LNCS vol. 4514 2007 84 99 (Pubitemid 47619127)
6. D. Bresolin, V. Goranko, A. Montanari, and G. Sciavicco Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions Annals of Pure and Applied Logic 161 2009 289 304
7. Bresolin, D., V. Goranko, A. Montanari and G. Sciavicco, Right propositional neighborhood logic over natural numbers with integer constraints for interval lengths, in: Proc. of the 7th IEEE Conf. on Software Engeneering and Formal Methods, 2009, pp. 240-249.
8. D. Bresolin, A. Montanari, and P. Sala An optimal tableau-based decision algorithm for Propositional Neighborhood Logic Proc. of STACS 2007 LNCS vol. 4393 2007 549 560
9. Chakravorty, G. and P. K. Pandya, Digitizing Interval Duration Logic, in: CAV, 2003, pp. 167-179.
10. Z. Chaochen, and M. Hansen An adequate first order interval logic Proc. of the 1997 International Symposium on Compositionality: The Significant Difference LNCS vol. 1536 1998 584 608
11. Z. Chaochen, and M.R. Hansen Duration Calculus: A Formal Approach to Real-Time Systems EATCS Monographs in Theoretical Computer Science 2004 Springer 257 pp
12. Z. Chaochen, C.A.R. Hoare, and A.P. Ravn A calculus of durations Information Processing Letters 40 1991 269 276
13. Z. Chaochen, Z. Jingzhong, Y. Lu, and L. Xiaoshan Linear Duration Invariants H. Langmaack, W.-P. de Roever, J. Vytopil, Formal Techniques in Real-Time and Fault-Tolerant Systems FTRTFT 2004 Lecture Notes In Computer Science vol. 863 1994 86 109
14. Fränzle, M. and M. R. Hansen, Deciding an interval logic with accumulated durations, in: TACAS, 2007, pp. 201-215. (Pubitemid 350259295)
15. V. Goranko, A. Montanari, and G. Sciavicco Propositional interval neighborhood temporal logics Journal of Universal Computer Science 9 2003 1137 1167 (Pubitemid 41151447)
16. J. Halpern, and Y. Shoham A propositional modal logic of time intervals Journal of the ACM 38 1991 935 962
17. M. Hansen, and D.V. Hung A theory of duration calculus with application Domain Modeling and the Duration Calculus LNCS vol. 4710 2007 119 176
18. M.R. Hansen, and Z. Chaochen Duration calculus: Logical foundations Formal Aspects of Computing 9 1997 283 330 (Pubitemid 127524208)
19. J. Kari Reversibility and surjectivity problems of cellular automata, Journal of Computer Systems and Science 48 1994 149 182 (Pubitemid 124012817)
20. Krishna, S. N. and P. K. Pandya, Modal Strength Reduction in Quantified Discrete Duration Calculus, in: FSTTCS, 2005, pp. 444-456. (Pubitemid 43846925)
21. Montanari, A., G. Puppis and P. Sala, Maximal Decidable Fragments of Halpern and Shohams Modal Logic of Intervals, in: Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP), 2010.
22. Moszkowski, B., "Reasoning about digital circuits," Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983).
23. P.K. Pandya Interval duration logic: Expressiveness and decidability Electronic Notes in Theoretical Computer Science 65 2002 254 272 theory and Practice of Timed Systems (Satellite Event of ETAPS 2002)