Hybrid logics on linear structures: Expressivity and complexity

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 166-173

  Franceschet, Massimo ^a,b   De Rijke, Maarten ^b   Schlingloff, Bernd Holger ^c  

^a UNIVERSITY OF CHIETI   (Italy)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; MODEL CHECKING;

COMPUTATIONAL SYSTEM; FIRST ORDER; HYBRID LANGUAGES; HYBRID LOGIC; LINEAR STRUCTURES; LINEAR-TIME MODEL-CHECKING; SATISFIABILITY; SATISFIABILITY PROBLEMS;

TEMPORAL LOGIC;

EID: 84944066420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2003.1214893     Document Type: Conference Paper

References (16)

1. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In J. Flum and M. Rodriguez-Artalejo, editors, Computer Science Logic, volume 1683 of LNCS, pages 307-321. Springer, 1999.
2. C. Areces, P. Blackburn, and M. Marx. The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8(5):653-679, 2000.
3. C. Areces, P. Blackburn, and M. Marx. Hybrid logics: Characterization, interpolation, and complexity. Journal of Symbolic Logic, 66(3):977-1010, 2001.
4. M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
5. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proceedings of Design Automation Conference, volume 1579 of Lectures Notes in Computer Science, pages 193-207, 1999.
6. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
7. P. Blackburn and J. Seligman. What are hybrid languages? In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, Volume 1, pages 41-62. CSLI Publications, 1998.
8. J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science, pages 1-11. Stanford University Press, 1962.
9. A. Cimatti, M. Pistore, M. Roveri, and R. Sebastiani. Improving the enconding of LTL model checking into SAT. In Proceedings of the Workshop on Verification Model Checking and Abstract Interpretation (VMCAI 2002), volume 2294 of Lectures Notes in Computer Science, 2002.
10. S. Demri and P. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Information and Computation, 174(1):84-103, 2002.
11. D. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects. Oxford logic guides, Vol. 28. Oxford University Press, 1994.
12. Y. Gurevich. Elementary properties of ordered abelian groups. Algebra and Logic, 3(1):5-39, 1964. Russian.
13. N. Markey. Past is for free: on the complexity of verifying linear temporal properties with past. In Proceedings of the International Workshop on Expressiveness in Concurrency (EXPRESS'2002), volume 68.2 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2002.
14. H. Ono and A. Nakamura. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, 39:325-333, 1980.
15. M. Reynolds. The complexity of the temporal logic with until over general linear time. Journal of Computer and System Science, to appear.
16. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.