Skip to main content

An Amalgamated Temporal Logic

  • Conference paper
ALPUK92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 37 Accesses

Abstract

There are two typical ways to formalize reasoning over time. The first is in a modal logic where time is characterized implicitly through tense operators. The second addresses time explicitly in a first-order theory, where the reasoning is itself essentially first order. In this paper we shall introduce an amalgamated temporal logic which combines the tense operators of the modal approach with the referential aspects of the first-order approach.

The modal operators of the new logic, called IQ-C, include the familiar tense operators plus a few new ones; together they allow complex temporal propositions to be represented in a compact form. Unlike standard modal temporal logics, IQ-C contains terms which refer to times; this allows the logic to characterize certain temporal properties and operators which cannot be axiomatized or defined by conventional modal operators. IQ-C is expressively complete over any connected flow of time, and has several other interesting theoretical properties, some of which will be developed in this paper.

Most interval logics take one of two approaches to temporal assertions; either they analyze assertions for intervals in terms of assertions at points, or they treat intervals as primitive, allowing assertions for intervals but not at points. IQ-C allows assertions both for intervals and at points, and treats them as independent; this yields a special degree of semantic discrimination and at the same time simplifies the representation of several temporal properties. In this paper we shall outline the IQ-C framework, specifying its special features and defining its semantics. We shall also extend a method of skolemization, which is designed to support a resolution based approach to the proof theory. This will be sketched in some detail, with a view to providing a preliminary account of the basic proof theory. A complete specification of the deductive theory, together with relevant proofs, will be developed elsewhere.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • M Abadi (1989) “The power of temporal proofs” Theoretical Computer Science 52.

    Google Scholar 

  • J Allen (1983) “Maintaining knowledge about temporal intervals” CACM 26 Vol 11.

    Google Scholar 

  • J Allen (1984) “Towards a general theory of action and time” Journal of Artificial Intelligence 23.

    Google Scholar 

  • J Allen & P Hayes (1987) “Moments and points in an interval-based temporal logic” IJCAI 87.

    Google Scholar 

  • Y Auffray et al (1990) “Strategies for modal resolution: results and problems” Journal of Automated Reasoning.

    Google Scholar 

  • F Baccus, J Tenenberg & J Koomen (1991) “A non-reified temporal logic” Journal of Artificial Intelligence 52.

    Google Scholar 

  • J van Benthm (1983) The Logic of Time Reidel Publishing Co.

    Google Scholar 

  • J van Benthem (1984) “Correspondence Theory” in D Gabbay & F Guenthner (eds), Handbook of Philosophical Vol 2 Reidel Publishing Co.

    Google Scholar 

  • P Blackburn (1990) Reasoning in and about Time PhD thesis, University of Edinburgh.

    Google Scholar 

  • K Bowen & R Kowalski (1982) “Amalgamating language and metalanguage in logic programming” in K Clark, S Tarnlund (eds.) Logic Programming Academic Press.

    Google Scholar 

  • J Burgess (1984) “Basic tense logic” in D Gabbay & F Guenthner (eds), Handbook ofPhilosophical Logic Vol 2 Reidel Publishing Co.

    Google Scholar 

  • F Del Cerro & A Herzberg (1992) “Modal Theorem Proving and its applications to epistemic and temporal logics” Studia Logica, to appear.

    Google Scholar 

  • T Dean & D McDermott (1987) “Temporal database management” Journal of Artificial Intelligence 32.

    Google Scholar 

  • A Galton (1990) “A critical examination of Allen’s theory of action and time” Journal of Artificial Intelligence 42.

    Google Scholar 

  • J Halpera & Y Shoham (1986) “A propositional modal logic of time intervals” IEEE Symposium on Logic in Computer Science.

    Google Scholar 

  • C Hamblin (1971) “Instants and Intervals” Studium Generale 27.

    Google Scholar 

  • R Hirsch (1991) “The expressive power of IQ” Technical Report, Department of Computing, Imperial College.

    Google Scholar 

  • L Humberstone (1979) “Interval semantics for tense logic: some remarks” Journal of Philosophical Logic 8.

    Google Scholar 

  • Y Jiang (1986) A Formalism for Representing Qualified Knowledge PhD thesis, University of Manchester.

    Google Scholar 

  • Y Jiang (1990) “An epistemic model of logic programming” New Generation Computing 8.

    Google Scholar 

  • Y Jiang & B Richards (1992) “A general proof procedure for the temporal logic IQ-C” forthcoming.

    Google Scholar 

  • Y Jiang, B Richards & H Choi (1991) “Actions and noninterference conditions” Proceedings of 1st World Conference on Fundamentals of Artificial Intelligence Paris.

    Google Scholar 

  • J Kamp (1968) Tense Logic and the Theory of Linear Order, PhD thesis, UCLA.

    Google Scholar 

  • R Kowalski & M Sergot (1986) “A logic-based calculus of events” New Generation Computing 4.

    Google Scholar 

  • P Ladkin (1987) “Models of axioms for time intervals” AAAI 87.

    Google Scholar 

  • J McCarthy & P Hayes (1969) “Some philosophical problems from the standpoint of artificial intelligence” Machine Intelligence 4.

    Google Scholar 

  • D McDermott (1982) “A temporal logic for reasoning about process and plans” Cognitive Science 6.

    Google Scholar 

  • H Ohlbach (1986) “A resolution calculus for modal logics” CADE 86.

    Google Scholar 

  • W Quine (1960) Word and Object MTT Press.

    MATH  Google Scholar 

  • B Richards (1986) “Tenses, temporal quantifiers and semantic innocence”, in E LePore Truth and Interpretation Oxford Press.

    Google Scholar 

  • B Richards et al (1989) Temporal Representation and Inference Academic Press.

    Google Scholar 

  • B Richards, Y. Jiang & H. Choi (1991) “On interval-based planning: An IQ strategy” ISMIS 6.

    Google Scholar 

  • Y Shoham (1987) “Temporal logics in AI: Semantical and ontological considerations” Journal of Artificial Intelligence 33.

    Google Scholar 

  • Y Venema “Expressiveness and completeness of an interval tense logic” Notre Dame Journal of Formal Logic 31.

    Google Scholar 

  • Y Venema “A modal logic for chopping intervals” Journal of Logic and Computation 1.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Jiang, Y., Richards, B. (1993). An Amalgamated Temporal Logic. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3421-3_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19783-6

  • Online ISBN: 978-1-4471-3421-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics