An automata-theoretic approach to constraint LTL

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

Volumn 2556 LNCS, Issue , 2002, Pages 121-132

  Demri, Stéphane ^a   D'Souza, Deepak ^b  

^a CNRS   (France)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; SOFTWARE ENGINEERING;

AUTOMATA-THEORETIC APPROACH; CONCRETE DOMAINS; CONSTRAINT SYSTEMS; LINEAR TIME TEMPORAL LOGIC;

TEMPORAL LOGIC;

EID: 84877767944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_12     Document Type: Conference Paper

References (12)

1. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-846, 1983.
2. Ph. Balbiani and J.F. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In Frontiers of Combining Systems (FroCoS'02), pages 162-176, 2002.
3. H. Comon and V. Cortier. Flatness is not a weakness. In 14 Int. Workshop Computer Science Logic, pages 262-276. LNCS, vol. 1862. Springer, 2000.
4. S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. CMI Internal Report TCS-02-01, 2002. http://www.cmi.ac.in.
5. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
6. D. Randell, Z. Cui, and A. Cohn. A spatial logic based on regions and connection. In 3rd Conference on Knowledge Representation and Reasoning, pages 165-176. Morgan Kaufman, 1992.
7. S. Safra. On the complexity of ω-automata. Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, 1988.
8. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. JACM, 32(3):733-749, 1985.
9. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.
10. M. Vardi and P. Wolper. An automata theoretic approach to automatic program verification. In Logic in Computer Science, pages 332-334. IEEE, 1986.
11. F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In KR'00, pages 3-14. Morgan Kaufmann, 2000.
12. F. Wolter and M. Zakharyaschev. Qualitative spatio-temporal representation and reasoning: a computational perspective. In Exploring Artificial Intelligence in the New Millenium, 2002. To appear.