Results for 'Temporal Logic'

1000+ found
Order:
See also
  1. Temporal Logic.Temporal Logic - forthcoming - Stanford Encyclopedia of Philosophy.
     
    Export citation  
     
    Bookmark  
  2.  3
    Temporal Logic: From Ancient Ideas to Artificial Intelligence.Peter Øhrstrøm & Per F. V. Hasle - 1995 - Dordrecht and Boston: Kluwer Academic Publishers.
    Temporal Logic: From Ancient Ideas to Artificial Intelligence deals with the history of temporal logic as well as the crucial systematic questions within the field. The book studies the rich contributions from ancient and medieval philosophy up to the downfall of temporal logic in the Renaissance. The modern rediscovery of the subject, which is especially due to the work of A. N. Prior, is described, leading into a thorough discussion of the use of (...) logic in computer science and the understanding of natural language. Temporal Logic: From Ancient Ideas to Artificial Intelligence thus interweaves linguistic, philosophical and computational aspects into an informative and inspiring whole. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   43 citations  
  3.  17
    Temporal Logic: Mathematical Foundations and Computational Aspects.Dov M. Gabbay, Ian Hodkinson & Mark A. Reynolds - 1994 - Oxford University Press on Demand.
    This long awaited book gives a thorough account of the mathematical foundations of Temporal Logic, one of the most important areas of logic in computer science.The book, which consists of fifteen chapters, moves on from giving a solid introduction in semantical and axiomatic approaches to temporal logic to covering the central topics of predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositionalquantifiers, expressive power, Henkin dimension, temporalization of other logics, and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   35 citations  
  4.  18
    Temporal Logics and Their Applications.Antony Galton - 1990 - Journal of Symbolic Logic 55 (1):364-366.
  5.  22
    Temporal Logic.Nicholas Rescher - 1971 - New York: Springer Verlag.
  6.  9
    Temporal Logics of “the Next” Do Not Have the Beth Property.Larisa Maksimova - 1991 - Journal of Applied Non-Classical Logics 1 (1):73-76.
  7.  6
    Using Temporal Logics of Knowledge for Specification and Verification—a Case Study.Clare Dixon - 2006 - Journal of Applied Logic 4 (1):50-78.
  8. Temporal Logic.Nicholas Rescher & Alasdair Urquhart - 1975 - Philosophy of Science 42 (1):100-103.
     
    Export citation  
     
    Bookmark   46 citations  
  9. Temporal Logic with Interacting Agents.Vladimir V. Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):293-308.
     
    Export citation  
     
    Bookmark   1 citation  
  10.  82
    Combining Temporal Logic Systems.Marcelo Finger & Dov Gabbay - 1996 - Notre Dame Journal of Formal Logic 37 (2):204-232.
    This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three submethods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  11.  16
    Temporal Logics and Their Applications, Edited by Antony Galton, Academic Press, London, San Diego, Etc., 1987, Xii + 244 Pp.—Therein: - Antony Galton. Temporal Logic and Computer Science: An Overview. Pp. 1– 52. - Howard Barringer. The Use of Temporal Logic in the Compositional Specification of Concurrent Systems. Pp. 53– 90. - Roger Hale. Temporal Logic Programming. Pp. 91– 119. - Fariba Sadri. Three Recent Approaches to Temporal Reasoning. Pp. 121– 168. - Antony Galton. The Logic of Occurrence. Pp. 169– 196. - Dov Gabbay. Modal and Temporal Logic Programming. Pp. 197– 237. [REVIEW]Luis Fariñas Del Cerro - 1990 - Journal of Symbolic Logic 55 (1):364-366.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12.  12
    The Temporal Logic of Two Dimensional Minkowski Spacetime is Decidable.Robin Hirsch & Mark Reynolds - 2018 - Journal of Symbolic Logic 83 (3):829-867.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  10
    Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.Benedikt Bollig, Aiswarya Cyriac, Paul Gastin & Marc Zeitoun - 2014 - Journal of Applied Logic 12 (4):395-416.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  15.  13
    Linear Temporal Logic with Until and Next, Logical Consecutions.V. Rybakov - 2008 - Annals of Pure and Applied Logic 155 (1):32-45.
    While specifications and verifications of concurrent systems employ Linear Temporal Logic , it is increasingly likely that logical consequence in image will be used in the description of computations and parallel reasoning. Our paper considers logical consequence in the standard image with temporal operations image and image . The prime result is an algorithm recognizing consecutions admissible in image, so we prove that image is decidable w.r.t. admissible inference rules. As a consequence we obtain algorithms verifying the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  16.  26
    A Temporal Logic for Reasoning About Processes and Plans.Drew McDermott - 1982 - Cognitive Science 6 (2):101-155.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   31 citations  
  17.  35
    Two Temporal Logics of Contingency.Matteo Pascucci - 2015 - Australasian Journal of Logic 12 (2):121-134.
    This work concerns the use of operators for past and future contingency in Priorean temporal logic. We will develop a system named C_t, whose language includes a propositional constant and prove that (I) C_t is complete with respect to a certain class of general frames and (II) the usual operators for past and future necessity are definable in such system. Furthermore, we will introduce the extension C_t(lin) that can be interpreted on linear and transitive general frames. The theoretical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  13
    Combining Linear-Time Temporal Logic with Constructiveness and Paraconsistency.Norihiro Kamide & Heinrich Wansing - 2010 - Journal of Applied Logic 8 (1):33-61.
  19. Complete Intuitionistic Temporal Logics for Topological Dynamics.Joseph Boudou, Martín Diéguez & David Fernández-Duque - 2022 - Journal of Symbolic Logic 87 (3):995-1022.
    The language of linear temporal logic can be interpreted on the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${\sf ITL}^{\sf c}_{\Diamond \forall }$, recently shown to be decidable by Fernández-Duque. In this article we axiomatize this logic, some fragments, and prove completeness for several familiar spaces.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  95
    Hierarchies of Modal and Temporal Logics with Reference Pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  21.  6
    Executing Temporal Logic Programs.Joseph Y. Halpern & B. C. Moszkowski - 1988 - Journal of Symbolic Logic 53 (1):309.
  22.  25
    Temporal Logic and its Application to Normative Reasoning.Emiliano Lorini - 2013 - Journal of Applied Non-Classical Logics 23 (4):372-399.
    I present a variant of with time, called, interpreted in standard Kripke semantics. On the syntactic level, is nothing but the extension of atemporal individual by: the future tense and past tense operators, and the operator of group agency for the grand coalition. A sound and complete axiomatisation for is given. Moreover, it is shown that supports reasoning about interesting normative concepts such as the concepts of achievement obligation and commitment.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  23.  93
    Three-Valued Temporal Logic Q T and Future Contingents.Seiki Akama, Yasunori Nagata & Chikatoshi Yamada - 2008 - Studia Logica 88 (2):215-231.
    Prior's three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued temporal logic $Q_t $ and give its axiomatization and semantics. We also argue that $Q_t $ provides a smooth solution to the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  88
    Dynamic Linear Time Temporal Logic.Jesper G. Henriksen & P. S. Thiagarajan - 1999 - Annals of Pure and Applied Logic 96 (1-3):187-207.
  25.  37
    Expressive Completeness of Temporal Logic of Trees.Bernd-Holger Schlingloff - 1992 - Journal of Applied Non-Classical Logics 2 (2):157-180.
    ABSTRACT Many temporal and modal logic languages can be regarded as subsets of first order logic, i.e. the semantics of a temporal logic formula is given as a first order condition on points of the underlying models (Kripke structures). Often the set of possible models is restricted to models which are trees. A temporal logic language is (first order) expressively complete, if for every first order condition for a node of a tree there (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  50
    Temporal Logic.Antony Galton - 2008 - Stanford Encyclopedia of Philosophy.
  27.  8
    Temporal Logic.Kit Fine - 1972 - Philosophical Quarterly 22 (89):370-371.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  28.  56
    A Quantified Temporal Logic for Ampliation and Restriction.Sara L. Uckelman - 2013 - Vivarium 51 (1-4):485-510.
    Temporal logic as a modern discipline is separate from classical logic; it is seen as an addition or expansion of the more basic propositional and predicate logics. This approach is in contrast with logic in the Middle Ages, which was primarily intended as a tool for the analysis of natural language. Because all natural language sentences have tensed verbs, medieval logic is inherently a temporal logic. This fact is most clearly exemplified in medieval (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  9
    Discrete Linear Temporal Logic with Current Time Point Clusters, Deciding Algorithms.V. Rybakov - 2008 - Logic and Logical Philosophy 17 (1-2):143-161.
    The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  30.  38
    Linear Temporal Logic as an Executable Semantics for Planning Languages.Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini & Valentina Poggioni - 2006 - Journal of Logic, Language and Information 16 (1):63-89.
    This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, Planning Domain Description Language with control Knowledge (PDDL-K), which allows one to specify a planning problem together with heuristic information that can be of help for both pruning the search space and finding better quality plans. The semantics of the language is given in terms of a translation into a set of LTL formulae. Planning is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  31.  29
    Linear-Time Temporal Logics with Presburger Constraints: An Overview ★.Stéphane Demri - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):311-347.
    We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are well-designed to specify and verify systems that can be modelled with counter systems. The paper recalls the general framework of LTL over concrete domains and presents the main decidability and complexity results related to fragments of Presburger LTL. Related formalisms are also briefly presented.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  32.  39
    An Alternating-Time Temporal Logic with Knowledge, Perfect Recall and Past: Axiomatisation and Model-Checking.Dimitar P. Guelev, Catalin Dima & Constantin Enea - 2011 - Journal of Applied Non-Classical Logics 21 (1):93-131.
    We present a variant of ATL with incomplete information which includes the distributed knowledge operators corresponding to synchronous action and perfect recall. The cooperation modalities assume the use the distributed knowledge of coalitions and accordingly refer to perfect recall incomplete information strategies. We propose a model-checking algorithm for the logic. It is based on techniques for games with imperfect information and partially observable objectives, and involves deciding emptiness for automata on infinite trees. We also propose an axiomatic system and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  27
    Decidable Fragments of First-Order Temporal Logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
    In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  34.  66
    A Temporal Logic for Sortals.Max A. Freund - 2001 - Studia Logica 69 (3):351-380.
    With the past and future tense propositional operators in its syntax, a formal logical system for sortal quantifiers, sortal identity and (second order) quantification over sortal concepts is formulated. A completeness proof for the system is constructed and its absolute consistency proved. The completeness proof is given relative to a notion of logical validity provided by an intensional semantic system, which assumes an approach to sortals from a modern form of conceptualism.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35. Temporal Logic: First International Conference, Ictl '94, Bonn, Germany, July 11 - 14, 1994. Proceedings.Dov M. Gabbay & Hans J. Ohlbach - 1994 - Springer Verlag.
    This volume constitutes the proceedings of the First International Conference on Temporal Logic, held at Bonn, Germany in July 1994. Since its conception as a discipline thirty years ago, temporal logic is studied by many researchers of numerous backgrounds; presently it is in a stage of accelerated dynamic growth. This book, as the proceedings of the first international conference particularly dedicated to temporal logic, gives a thorough state-of-the-art report on all aspects of temporal (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  33
    Unification in Linear Temporal Logic LTL.Sergey Babenyshev & Vladimir Rybakov - 2011 - Annals of Pure and Applied Logic 162 (12):991-1000.
    We prove that a propositional Linear Temporal Logic with Until and Next has unitary unification. Moreover, for every unifiable in LTL formula A there is a most general projective unifier, corresponding to some projective formula B, such that A is derivable from B in LTL. On the other hand, it can be shown that not every open and unifiable in LTL formula is projective. We also present an algorithm for constructing a most general unifier.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  37.  4
    Alternating Automata and Temporal Logic Normal Forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
    We provide a translation from SNFPLTL, a normal form for propositional linear time temporal logic, into alternating automata on infinite words, and vice versa. We show this translation has the property that the set of SNFPLTL clauses is satisfiable if and only if the alternating automaton has an accepting run. As there is no direct method known for checking the non-emptiness of alternating automata, the translation to SNFPLTL, together with a temporal proof on the resulting SNFPLTL clauses, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  38. Temporal Logic From Ancient Ideas to Artificial Intelligence.Peter Ørstrø & Per F. V. Hasle - 1995
     
    Export citation  
     
    Bookmark   3 citations  
  39.  34
    Bisimulations for Temporal Logic.Natasha Kurtonina & Maarten de Rijke - 1997 - Journal of Logic, Language and Information 6 (4):403-425.
    We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  40.  12
    Hybrid Languages and Temporal Logic.P. Blackburn & M. Tzakova - 1999 - Logic Journal of the IGPL 7 (1):27-54.
    Hybridization is a method invented by Arthur Prior for extending the expressive power of modal languages. Although developed in interesting ways by Robert Bull, and by the Sofia school , the method remains little known. In our view this has deprived temporal logic of a valuable tool.The aim of the paper is to explain why hybridization is useful in temporal logic. We make two major points, the first technical, the second conceptual. First, we show that hybridization (...)
    Direct download  
     
    Export citation  
     
    Bookmark   22 citations  
  41. Temporal Logics in AI: Semantical and Ontological Considerations.Yoav Shoham - 1987 - Artificial Intelligence 33 (1):89-104.
  42.  1
    Using Temporal Logics to Express Search Control Knowledge for Planning.Fahiem Bacchus & Froduald Kabanza - 2000 - Artificial Intelligence 116 (1-2):123-191.
  43. Review: Antony Galton, Temporal Logics and Their Applications; Antony Galton, Temporal Logic and Computer Science: An Overview. [REVIEW]Luis Farinas Del Cerro - 1990 - Journal of Symbolic Logic 55 (1):364-366.
     
    Export citation  
     
    Bookmark  
  44.  59
    The Complexity of Temporal Logic Over the Reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.
    It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense time temporal logic.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  45. The Tableau Method for Temporal Logic: An Overview.Pierre Wolper - 1985 - Logique Et Analyse 28 (110-111):119-136.
     
    Export citation  
     
    Bookmark   15 citations  
  46.  7
    Review: Nicholas Rescher, Temporal Logic[REVIEW]Robert A. Bull - 1975 - Journal of Symbolic Logic 40 (2):252-253.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  44
    A Decidable Temporal Logic of Parallelism.Mark Reynolds - 1997 - Notre Dame Journal of Formal Logic 38 (3):419-436.
    In this paper we shall introduce a simple temporal logic suitable for reasoning about the temporal aspects of parallel universes, parallel processes, distributed systems, or multiple agents. We will use a variant of the mosaic method to prove decidability of this logic. We also show that the logic does not have the finite model property. This shows that the mosaic method is sometimes a stronger way of establishing decidability.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  48.  8
    Fibring Epistemic and Temporal Logics.Krzysztof Aleksander Krawczyk - 2019 - Logic and Logical Philosophy 29 (1):195.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  10
    Reasoning About XML with Temporal Logics and Automata.Leonid Libkin & Cristina Sirangelo - 2010 - Journal of Applied Logic 8 (2):210-232.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  50.  82
    Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 1000