First order linear temporal logic over finite time structures

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

Volumn 1705 LNAI, Issue , 1999, Pages 62-76

  Cerrito, Serenella ^a   Mayer, Marta Cialdea ^b   Praud, Sébastien ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; FINS (HEAT EXCHANGE);

FIXED POSITIVE INTEGERS; LINEAR INEQUALITIES; LINEAR TEMPORAL LOGIC; OBJECT DOMAINS; SOUND AND COMPLETE; TEMPORAL CONSTRAINTS; TEMPORAL INTERVALS; TEMPORAL MODELS;

TEMPORAL LOGIC;

EID: 84886295158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_5     Document Type: Conference Paper

References (19)

1. M. Abadi. The power of temporal proofs. TTieoretical Computer Science, 65:35-83, 1989.
2. M. Abadi and Z. Manna. NonclauscJ deduction in first-order temporal logic. Journal of the Association for Computing Machinery, 37:279-317, 1990.
3. S. Abiteboul, L. Herr, and J. Vam den Bussche. Temporal versus first-order logic to query temporal databases. In Proc. of the 15th Int. Conf. on Principles of Databases (PODS'96), 1996.
4. H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. METATEM: a framework for progreunming in temporal logic. In Prvc. of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 30 of LNCS. Springer, 1989.
5. V. Benziken, S. Cerrito, and S. Fraud. Verification statique de contraintes d'inté grite dynamiques. In Proc. of 1 dimes Joumies Bases de Donnees Avanc6es (BDA99), Bordeaux, Prance, October 1999. To appear.
6. N Bidoit iind S. De Amo. A first step towztrds implementing dynamic algebraic dependencies. Theoretical Computer Science, 2(190):115-149, January 1998.
7. S. Cerrito and M. Cialdea Mayer. Bounded model search in linear temporal logic smd its application to planning. In H. De Swart, editor, International Conference on Automated Reasoning with Analytical Tableaux and Related Methods, pages 124- 140. Springer, 1998.
8. S. Cerrito and M. Cialdea Mayer. Using lineau: temporal logic to model and solve planning problems. In F. Giunghiglia, editor, Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA '98), pages 141-152. Springer Verlag, 1998.
9. S. Cerrito, M. Cialdea Mayer, and S. Fraud. First order linear temporal logic over finite time structures is not semi-decidable. Tecnicsil Report LRJ n. 1208, available at http://www.dia.uniroma3.it/~cialdea/papers/nonre.ps. Fresented at the Workshop Methods for Modalities 1 (M4M) (Amsterdam, May 1999).
10. S. Cerrito, M. Cialdea Mayer, and S. Fraud. A tableau calculus for first order linear temporal logic over bounded time structures. Technical Report LRI n. 1207, available at http://www.dia.uniroma3.it/~cialdea/papers/foltl.ps.
11. J. Chomicki. TemporEil query languages: a survey. In D.M. Gabbay Emd H.J. Ohlbach, editors, Temporal Logic: ICTL'94, volume 827 of Lecture Notes in Computer Science, pages 506-534. Springer-Verlag, 1994.
12. D. Gabbay. Declarative past and imperative future: Executable temporal logic for interactive systems. In B. Banieqbal, H. Barringer, and A. Fnueli, editors, Proc. of Colloquium on Temporal Logic in Specification, number 398 in LNCS, pages 409-448. Sprinber-Verlag, 1989.
13. R. Hahnle and O. Ibens. Improving temporaJ logic tableaux using integer constrstints. In D. M. Gabbay and H. J. Ohlbach, editors. Proceedings of the First International Conference on Temporal Logic (ICTL 94), volume 827 of LNCS, pages 535-539. Springer, 1994.
14. D. Harel. Recurring dominoes: Making the higly undecidable higly understandable. Annals of Discrete Mathematics, 24:51-72, 1985
15. M Kaminski sind C.K. Wong. The power of the "always" operator in first-order temporsd logic. Theoretical Computer Science, pages 271-281, 1996.
16. F. Kroger. On the interpretability of arithmetic in temporal logic. Theoretical Computer Science, 73:47-61, 1990.
17. F.H. Schmitt and J. Goubault-Larrecq. A tableau system for full linear temporal logic. Draft, av2dlable at: http://www.dyade.fr/fr/actions/vip/jgl/ ltl2.ps.gz.
18. F.H. Schmitt and J. Goubault-Larrecq. A tableau system for linear-time temporal logic. In E. Brinksma, editor, 3rd Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), LNCS. Springer Verlag, 1997.
19. F. Wolper. The tableau method for temporal logic: an overview. Logique et Analyse, 28:119-152, 1985.