Back Article

Abadi M, 1989. “The power of temporal proofs” Theoretical Computer Science6435–84.

Abadi M and Manna Z, 1989. “Temporal logic programming” Journal of Symbolic Computation8277–295.

Abadi M and Manna Z, 1990. “Nonclausal deduction in first-order temporal logic” ACM Journal37 (2) 279–317.

Aït-Kaci H, 1991. Warren's Abstract Machine—A Tutorial Reconstruction, MIT Press.

Allen J, 1983. “Maintaining knowledge about temporal intervals” Comm. ACM26 (11) 832–843.

Allen J, 1984. “Towards a general theory of action and time” Artificial Intelligence23 (2) 123–154.

Allen J and Hayes P, 1985. “A common sense theory of time”. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)528–531, Los Angeles CA.

Allen J and Koomen J, 1983. “Planning using a temporal world model”. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)741–747, Karlsruhe, Germany.

Balbiani PHerzig A and Lima-Marques M, 1991. “TIM: The Toulouse Inference Machine for non- classical logic programming” Lecture Notes in Computer Science567, Springer-Verlag.

Banieqbal B and Barringer H, 1986. “A study of an extended temporal language and a temporal fixed point calculus” Technical Report UMCS-86−10–2, Department of Computer Science, University of Manchester.

Barringer H, Fisher M, Gabbay D, Gough G and Owens R, 1989. “METATEM: a framework for programming in temporal logic”. In: Proceedings of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook, Netherlands. (Published in Lecture Notes in Computer Science 430. Springer-Verlag.)

Barringer H, Fisher M, Gabbay D and Hunter A, 1991. “Meta-reasoning in executable temporal logic”. In: Allen J, Fikes R and Sandewall E, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR)Cambridge, MA. Morgan Kaufmann.

Baudinet M, 1989. “Temporal logic programming is complete and expressive”. In: Proceedings of the Sixteenth ACM Symposium on the Principles of Programming Languages (POPL) Austin, Texax. ACM Press.

Baudinet M, 1992. “A simple proof of the completeness of temporal logic programming”. In: del Cerro, LF and Penttonen M, editors, Intensional Logics for Programming. Oxford University Press.

Brzoska C, 1991. “Temporal logic programming and its relation to constraint logic programming”. In:Proceedings of International Symposium on Logic Programming (ILPS)San Diego, CA. MIT Press.

Brzoska C, 1995. “Temporal logic programming with metric and past operators”. In: Fisher M and Owens R, editors, Executable Modal and Temporal Logics: vol 897 of Lecture Notes in Artificial Intelligence. Springer-Verlag.

Brzoska C and Schafer K, 1993. “LIMETFE: Logic programming integrating metric temporal extensions— language definition and user manual”. Interner Bericht 9/93, Fak für Informatik, Universität Karlsruhe.

Bull R and Segerberg K, 1984. “Basic modal logic”. In: Gabbay D and Guenthner F, editors, Handbook of Philosophical Logic (II): Vol. 165 of Synthese Library, Chapter 11.1, pp. 1–88. Reidel.

Burgess J, 1984. “Basic tense logic”. In: Gabbay D and Guenthner F, editors, Handbook of Philosophical Logic (II): Vol. 165 of Synthese Library, Chapter 11.2, pp. 89–134.

Dean T, 1987. “Large-scale temporal data bases for planning in complex domains”. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)860–866, Milan, Italy.

Emerson E, 1990. “Temporal and modal logic”. In: van Leeuwen J, editor, Handbook of Theoretical Computer Science996–1072. Elsevier.

Emerson E and Halpern J, 1986. “‘Sometimes’ and ‘Not Never’ revisited: on branching versus linear time temporal logic” Journal of the ACM33 (1) 151–178.

Finger M, Fisher M and Owens R, 1993. “METATEM at work: modelling reactive systems using executable temporal logic”. In: Sixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE)Edinburgh, UK. Gordon and Breach.

Finger M, McBrien P and Owens R, 1991. “Databases and executable temporal logic”. In: Proceedings of the ESPRIT Conference Brussels, Belgium.

Fisher M, 1991. “A re/ution method for temporal logic”. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI)Sydney, Australia. Morgan Kaufmann.

Fisher M, 1992. “A normal form for first-order temporal formulae”. In: Proceedings of Eleventh International Conference on Automated Deduction (CADE)Saratoga Springs New York. (Published in Lecture Notes in Computer Science, 607, Springer-Verlag.)

Fisher M, 1993. “Concurrent METATEM—A language for modeling reactive systems”. In: Parallel Architectures and Languages, Europe (PARLE)Munich, Germany. (Published as Lecture Notes in Computer Science, 694, Springer-Verlag.)

Fisher M, 1994. “A survey of concurrent METATEM—The language and its applications”. In: First International Conference on Temporal Logic (ICTL)Bonn, Germany. (Published in Lecture Notes in Computer Science, 827, Springer-Verlag.)

Fisher M and Noel P, 1992. “Transformation and synthesis in METAM—Part I: Propositional METATEM. Technical Report UMCS−92−2−1 Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK.

Fisher M and Owens R, 1992. “From the past to the future: executing temporal logic programs”. In: Proceedings of Logic Programming and Automated Reasoning (LPA R)St. Petersberg, Russia. (Published in Lecture Notes in Computer Science, 624, Springer-Verlag.)

Fisher M and Owens R, editors, 1995. Executable Modal and Temporal Logics. vol. 897 of Lecture Notes in Artificial Intelligence. Springer-Verlag.

Fisher M and Wooldridge M, 1993b. “Executable temporal logic for distributed A.I.” In: Twelfth International Workshop on Distributed A.I.Hidden Valley Resort, Pennsylvania.

Frühwirth T, 1995. “Temporal logic and annotated constraint logic programming”. In: Fisher M and Owens R, editors, Executable Modal and Temporal Logics, vol. 897 of Lecture Notes in Artificial Intelligence. Springer: Verlag.

Fujita M, Kono S, Tanaka T and Moto-oka T, 1986. “Tokio: Logic programming language based on temporal logic and its compilation into Prolog”. In: 3rd International Conference on Logic ProgrammingLondon, UK. (Published in Lecture Notes in Computer Science, 225, Springer-Verlag.)

Gabbay D, 1987. “Declarative past and imperative future: executable temporal logic for interactive systems”. In: Banieqbal B, Barringer H and Pnueli A, editors, Proceedings of Colloquium on Temporal Logic in Specification402–450, Altrincham, UK. (Published in Lecture Notes in Computer Science, 398, Springer-Verlag.)

Gabbay D, 1991. “Modal and temporal logic II (a temporal Prolog machine)”. In: Dodd T, Owens R, and Torrance S, editors, Logic Programming—Expanding the Horizon. Intellect Books.

Gabbay D, Pnueli A, Shelah S and Stavi J, 1980. “The temporal analysis of fairness”. In: Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages (POPL)163–173, Las Vegas NV, ACM Press.

Hale R and Moszkowski B, 1987. “Parallel programming in temporal logic”. In: ParallelArchitectures and Languages Europe (PARLE)Eindhoven, The Netherlands. (Published as Lecture Notes in Computer Science, 259, Springer-Verlag.)

Hrycej T, 1988. “Temporal Prolog”. In: Kodratoff Y, editor, Proceedings of the European Conference on Artificial Intelligence296–301. Pitman.

Hrycej T, 1993. “A temporal extension of Prolog” Journal of Logic Programming15(1&2) 113–145.

Johnson CW and Harrison MD, 1992. “Using temporal logic to support the specification and prototyping of interactive control systems” International Journal of Man-Machine Studies36.

Jones CB, 1986. Systematic Software Development Using VDM Prentice Hall.

K& JAW, 1968. Tense Logic and the Theory of Linear Order PhD thesis, University of California.

King P, 1995. “Towards an ITL based formalism for expressing temporal constraints in multimedia documents”. In: Proceedings of IJCAI Workshop on Executable Temporal Logics Montreal, Canada.

Kono S., 1995. “A combination of clausal and non-clausal temporal logic programs”. In: Fisher M and Owens R, editors, Executable Modal and Temporal Logics, vol 897 of Lecture Notes in Artificial Intelligence. Springer-Verlag.

Kröger F, 1987. Temporal Logic of Programs Monographs on Theoretical Computer Science. Springer- Verlag.

Manna Z and Pnueli A, 1992. The Temporal Logic of Reactive and Concurrent Systems: SpecificationSpringer-Verlag.

Merz S, 1995. “Efficiently executable temporal logic programs”. In: Fisher M and Owens R, editors, Executable Modal and Temporal Logics, vol 897 of Lecture Notes in Artificial Intelligence. Springer- Verlag.

Moszkowski B, 1983. “Reasoning about digital circuits” Technical report, Stanford University.

Moszkowski B, 1986. Executing Temporal Logic ProgramsCambridge University Press.

Moszkowski B and Manna Z, 1984. “Reasoning in interval temporal logic”. In: AMC/NSF/ONR Workshop on Logics of Programs Berlin, Germany. (Published as Lecture Notes in Computer Science, 164, Springer- Verlag.)

Orgun M and Ma W, 1994. “An overview of temporal and modal logic programming”. In: First Internaional Conference on Temporal Logic (ICTL)Bonn, Germany. (Published in Lecture Notes in Computer Science, 827, Springer-Verlag.)

Orgun M and Wadge W, 1992a. “Theory and practice of temporal logic programming”. In: del Cerro, LF and Penttonen M, editors, Intensional Logics for ProgrammingOxford University Press.

Orgun MA and Wadge W, 1992b. “Towards a unified theory of intensional logic programming”. Journal of Logic Programming13 (1, 2, 3 and 4) 413–440.

Schäfer K, 1993. “Entwicklung einer temporal logischen Sprache zur Beschreibung von Ablaufen in Straβenverkehrsszenen” Diplomarbeit, Universität Karlsruhe, Inst. für Logik, Komplexität und Deduktionssysteme.

Schwartz R, Melliar-Smith P and Vogt F, 1983. “An interval-based temporal logic” Lecture Notes in Computer Science164443–457.

Sistla A and Clarke E, 1985. “Complexity of propositional linear temporal logics” ACM Journal32 (3) 733–749.

Sterling L and Shapiro E, 1987. The Art of PrologMIT Press.

Szalas A and Holenderski L, 1988. “Incompleteness of first-order temporal logic with until” Theoretical Computer Science57317–325.

Tang T, 1989. “Temporal Logic CTL + Prolog” Journal of Automated Reasoning549–65.

Van Bentham J, 1988. “A logician's point of view concerning the use of temporal logic in computer science”. In: REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. (Published as Lecture Notes in Computer Science, 354, Springer-Verlag.)

Wolper P, 1985. “The tableau method for temporal logic: an overview” Logique et Analyse110–111, 119–136.