Abstract
In recent years a number of programming languages based upon the direct execution of either modal or temporal logic formulae have been developed. This use of non-classical logics provides a powerful basis for the representation and implementation of a range of dynamic behaviours. Though many of these languages are still experimental, they are beginning to be applied, not only in Computer Science and AI, but also in less obvious areas such as process control and social modelling.
This paper provides an introduction to some of the basic concepts of executable modal and temporal logics.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277–295, 1989.
M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal, 37(2):279–317, April 1990.
M. Abadi. The Power of Temporal Proofs. Theoretical Computer Science, 64:35–84, 1989.
J. Allen and J. Koomen. Planning using a temporal world model. In Proc. IJCAI-83, pages 741–747, Karlsruhe, August 1983.
J. Allen. Maintaining Knowledge about temporal intervals. Comm. ACM, 26(11):832–843, November 1983.
J. Allen. Towards a general theory of action and time. Artificial Intelligence, 23(2):123–154, 1984.
J. Allen and P. Hayes. A Common Sense Theory of Time. In Proc. IJCAI-85, pages 528–531, Los Angeles, California, August 1985.
J-M. Alliot, A. Herzig and M. Lima-Marques. Implementing Prolog Extensions: a Parallel Inference Machine. In Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, Japan, 1992.
P. Balbiani, A. Herzig, and M. Lima-Marques. TIM: The Toulouse Inference Machine for Non-Classical Logic Programming. Lecture Notes in Computer Science, 567, 1991.
B. Banieqbal and H. Barringer. 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, November 1986.
H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. MetateM: A Framework for Programming in Temporal Logic. In Proceedings of REX Workshop on Step-wise Refinement of Distributed Systems: Models, Formalisms, Correctness, Mook, Netherlands, June 1989. (Published in Lecture Notes in Computer Science, volume 430, Springer Verlag).
H. Barringer, M. Fisher, D. Gabbay, and A. Hunter. Meta-Reasoning in Executable Temporal Logic. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), Cambridge, Massachusetts, April 1991. Morgan Kaufmann.
M. Baudinet. A Simple Proof of the Completeness of Temporal Logic Programming. In L Fariñas del Cerro and M. Penttonen, editors, Intensional Logics for Programming. Oxford University Press, 1992.
M. Baudinet. Temporal Logic Programming is Complete and Expressive. In POPL16, Austin, Texas, January 1989. ACM.
C. Brzoska. Temporal Logic Programming with Metric and Past Operators. (In this volume.)
C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proceedings of International Symposium on Logic Programming (ILPS), San Diego, U.S.A., November 1991. (Published by MIT Press.).
C. Brzoska and K. Schafer. LIMETTE: Logic programming integrating metric temporal extensions, language definition and user manual. Interner Bericht 9/93, Fak. für Informatik, Universität Karlsruhe, 1993.
R. Bull and K. Segerberg. Basic Modal Logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume II. Reidel, 1984.
J. Burgess. Basic Tense Logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume II. Reidel, 1984.
M. Cavalcanti. Solving Air-Traffic Problems with “Possible Worlds”. (In this volume.)
E. M. Clarke and E. A. Emerson. Using Branching Time Temporal Logic to Synthesise Synchronisation Skeletons. Science of Computer Programming, 2:241–266, 1982.
T. Dean. Large-Scale Temporal Data Bases for Planning in Complex Domains. In Proc. IJCAI-87, pages 860–866, Milan, August 1987.
N. Den Haan. Investigations into the Application of Deontic Logic. (In this volume.)
E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 996–1072. Elsevier, 1990.
L. Fariñas del Cerro. Resolution modal logics. Logique et Analyse, 152–172, 1985.
L. Farinas del Cerro. MOLOG: A system that extends Prolog with modal logic. New Generation Computing, February 1986.
M. Finger, M. Fisher, and R. Owens. 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-93), Edinburgh, U.K., June 1993. Gordon and Breach Publishers.
M. Finger, P. McBrien, and R. Owens. Databases and Executable Temporal Logic. In Proceedings of the ESPRIT Conference, November 1991.
M. Fisher. A Survey of Concurrent MetateM — The Language and its Applications. In First International Conference on Temporal Logic (ICTL), July 1994.
M. Fisher and P. Noël. Transformation and Synthesis in MetateM — Part I: Propositional MetateM. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K., February 1992.
M. Fisher and R. Owens. From the Past to the Future: Executing Temporal Logic Programs. In Proceedings of Logic Programming and Automated Reasoning (LPAR), St. Petersberg, Russia, July 1992. (Published in Lecture Notes in Computer Science, volume 624, Springer-Verlag).
M. Fisher and M. Wooldridge. A Logical Approach to the Representation of Societies of Agents. In Proceedings of Second International Workshop on Simulating Societies (SimSoc), Certosadi Pontignano, Siena, Italy, July 1993.
M. Fisher and M. Wooldridge. Executable Temporal Logic for Distributed A.I. In Twelfth International Workshop on Distributed A.I., Hidden Valley Resort, Pennsylvania, May 1993.
M. Fisher and M. Wooldridge. Specifying and Verifying Distributed Intelligent Systems. In Portuguese Conference on Artificial Intelligence (EPIA). Springer-Verlag, October 1993.
M. Fisher and M. Wooldridge. Specifying and Executing Protocols for Cooperative Action. In Proceedings of International Working Conference on Cooperating Knowledge-BasedSystems (CKBS), Keele, June 1994.
M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.
M. Fisher. A Normal Form for First-Order Temporal Formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE), Saratoga Springs, New York, June 1992. (Published in LectureNotes in Computer Science, volume 607, Springer-Verlag).
M. Fisher. Concurrent MetateM—A Language for Modelling Reactive Systems. In Parallel Architectures and Languages, Europe (PARLE), Munich, Germany, June 1993. Springer-Verlag.
M. Fitting. Proof methods for modal and intuitionistic logics. Reidel Publishers, 1983.
T. Frühwirth. Temporal Logic and Annotated Constraint Logic Programming. (In this volume.)
M. Fujita, S. Kono, T. Tanaka, and T. Moto-oka. Tokio: Logic Programming Language based on Temporal Logic and its compilation into Prolog. In 3rd International Conference on Logic Programming, London, July 1986. (Published in Lecture Notes in Computer Science, volume 225, Springer-Verlag).
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. The Temporal Analysis of Fairness. In Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages, pages 163–173, Las Vegas, Nevada, January 1980.
D. Gabbay. Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proceedings of Colloquium on Temporal Logic in Specification, pages 402–450, Altrincham, U.K., 1987. (Published in Lecture Notes in Computer Science, volume 398, Springer-Verlag).
D. Gabbay. Modal and Temporal Logic II (A Temporal Prolog Machine). In T. Dodd, R. Owens, and S. Torrance, editors, Logic Programming-Expanding the Horizon. Intellect Books Ltd, 1991.
R. Hale and B. Moszkowski. Parallel programming in temporal logic. In Parallel Architectures and Languages Europe (PARLE), Eindhoven, The Netherlands, June 1987. (Published as Lecture Notes in Computer Science, volume 259, Springer Verlag, Berlin.).
T. Hrycej. Temporal Prolog. In Yves Kodratoff, editor, Proceedings of the European Conference on Artificial Intelligence, pages 296–301. Pitman Publishing, August 1988.
T. Hrycej. A temporal extension of Prolog. The Journal of Logic Programming, 15(1 & 2):113–145, January 1993.
G. Hughes and M. Cresswell. A Companion to Modal Logic. Methuen (UP), 1984.
J. Jaffir and J-L. Lassez. Constraint Logic Programming. In Proceedings of the Fourteenth ACM Symposium on the Principles of Programming Languages, pages 111–119, Munich, West Germany, January 1987.
J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, May 1968.
S. Kono. A Combination of Clausal and Non Clausal Temporal Logic Programs. (In this volume.)
F. Kroger. Temporal Logic of Programs. Springer-Verlag, 1987.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.
S. Merz. Efficiently Executable Temporal Logic Programs. (In this volume.)
S. Merz. Decidability and Incompleteness Results for First-Order Temporal Logics of Linear Time. In Journal of Applied Non-Classical Logics, 2(2), 1992.
B. Moszkowski. Reasoning about digital circuits. PhD Thesis, Stanford University, July 1983.
B. Moszkowski. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, U.K., 1986.
B. Moszkowski and Z. Manna. Reasoning in Interval Temporal Logic. Lecture Notes in Computer Science, 164, 1984.
M. Orgun and W. Wadge. Theory and Practice of Temporal Logic Programming. In L Farinas del Cerro and M. Penttonen, editors, Iniensional Logics for Programming. Oxford University Press, 1992.
M. Orgun and W. Wadge. Towards a unified theory of intensional logic programming. The Journal of Logic Programming, 13(1, 2, 3 and 4):413–440, 1992.
M. Reynolds. Towards First-Order Concurrent MetateM. (In this volume.)
A. P. Sistla and E. M. Clarke. Complexity of prepositional linear temporal logics. ACM Journal, 32(3):733–749, July 1985.
K. Schäfer. Entwicklung einer temporallogischen Sprache zur Beschreibung von Abläufen in Straßenverkehrsszenen. Diplomarbeit, Universität Karlsruhe, Inst. für Logik, Komplexität und Deduktionssysteme, 1993.
R. Schwartz, P. Melliar-Smith and F. Vogt. An Interval-Based Temporal Logic. Lecture Notes in Computer Science, 164, 1984.
A. Szalas and L. Holenderski. Incompleteness of First-Order Temporal Logic with Until. Theoretical Computer Science, 57:317–325, 1988.
T. Tang. Temporal Logic CTL + Prolog. Journal of Automated Reasoning, 5:49–65, 1989.
J. van Bentham. Correspondence Theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume II. Reidel, 1984.
L. Wallen. Automated Deduction in Non-Classical Logics. MIT Press, 1990.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fisher, M., Owens, R. (1995). An introduction to executable modal and temporal logics. In: Fisher, M., Owens, R. (eds) Executable Modal and Temporal Logics. IJCAI 1993. Lecture Notes in Computer Science, vol 897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58976-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-58976-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58976-1
Online ISBN: 978-3-540-49168-2
eBook Packages: Springer Book Archive