Abstract
Important forms of reasoning such as planning and scheduling can be both temporal and non-monotonic in nature. For a logic-based solution, such reasoning requires (1) the specification of components of a plan, or schedule, in a language that is sufficiently expressive and natural for notions of time and defeasibility, and (2) the facility to demonstrate the satifiability of the specification. For (2) we effectively need to build a model of the specification. Here we present a non-monotonic temporal logic NTE that is a development of executable temporal logics (Gabbay 1989) and the non-monotonic atemporal logic KAL (Hunter 1990). The development of NTE is intended as an initial attempt at addressing the requirements of (1) and (2) above.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bacchus F, Tenenberg J, & Koomen J (1989) A non-reified temporal logic, Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning, Morgan Kaufmann
Baker A (1989) A simple solution to the Yale shooting problem, Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning, Morgan Kaufmann
Barringer H, Fisher M, Gabbay D, Gough G & Owens R (1990) MetateM: A framework for programming in temporal logic, in REX Workshop on Stepwise Refinement of Distributed Systems, LNCS 430, 94–129, Springer
Barringer H, Fisher M, Gabbay D, & Hunter A (1991) Meta-Reasoning in Executable Temporal Logic, Proceedings of the Second International Conference on the Principles of Knowledge Representation and Reasoning, Morgan Kaufmann
Fitting M (1983) Proof Methods for Modal and Intuitionistic Logics, Reidel
Gabbay D (1989) The declarative past and imperative future: Executable temporal logic for interactive systems, in Banieqbal B, Barringer H, & Pnueli A, Proceedings of Colloquium on Temporal Logic in Specification, LNCS 398, 409–448, Springer
Gabbay D, Hodkinson I, and Hunter A (1991) Using the temporal logic RDL for design specifications, in Yonezawa A, Concurrency: Theory, Language and Architecture, LNCS 491, Springer
Hunter A, (1990) KAL: A linear-ordered logic for non-monotonic reasoning, Draft paper, Imperial College, London
Kamp J (1968) Tense Logic and the Theory of Linear Order, PhD thesis, UCLA
Kowalski R & Sergot M, (1986) A logic-based calulus of events, New Generation Computing, 4, 67–95
Laenens E & D Vermier (1990) A fixpoint semantics of ordered logics, Journal of Logic and Computation, 1, 159–185
Shoham Y (1987) Reasoning About Change, MIT Press
Wolper P (1985) The tableau method for temporal logic: an overview, Logique et Analyse, 110–111, 119–136
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hunter, A. (1991). Execution of defeasible temporal clauses for building preferred models. In: Jorrand, P., Kelemen, J. (eds) Fundamentals of Artificial Intelligence Research. FAIR 1991. Lecture Notes in Computer Science, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54507-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-54507-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54507-1
Online ISBN: 978-3-540-38420-5
eBook Packages: Springer Book Archive