Search results for 'temporal logic' (try it on Scholar)

1000+ found
Order:
See also:
  1.  14
    Temporal Logic (forthcoming). Temporal Logic. Stanford Encyclopedia of Philosophy.
    Direct download  
     
    Export citation  
     
    My bibliography  
  2.  6
    Walter A. Carnielli, Itala M. L. D'ottaviano & Brazilian Conference on Mathematical Logic (1999). Advances in Contemporary Logic and Computer Science Proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador, Bahia, Brazil. [REVIEW] Monograph Collection (Matt - Pseudo).
    This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society (co-sponsored by the Centre for Logic, Epistemology and the History of Science, State University of Campinas, Sao Paulo) in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  79
    Stefano Baratella & Andrea Masini (2006). A Note on Unbounded Metric Temporal Logic Over Dense Time Domains. Mathematical Logic Quarterly 52 (5):450-456.
    We investigate the consequences of removing the infinitary axiom and rules from a previously defined proof system for a fragment of propositional metric temporal logic over dense time.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  4.  21
    D. M. Gabbay & G. Malod (2002). Naming Worlds in Modal and Temporal Logic. Journal of Logic, Language and Information 11 (1):29-65.
    In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x, y)which states that two time points are at the same distance from the root. We provide the systems studied with complete axiomatizations and illustrate the expressive power gained for modal logic by simulating other logics. The completeness proofs rely on the fairly intuitive notion of a (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  5.  30
    Natasha Kurtonina & Maarten de Rijke (1997). Bisimulations for Temporal Logic. 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 (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  33
    Mark Brown & Valentin Goranko (1999). An Extended Branching-Time Ockhamist Temporal Logic. Journal of Logic, Language and Information 8 (2):143-166.
    For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated restricted variables called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modality, localized to the set of all possible futures at the actual moment of time.We construct an axiomatic (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  7.  5
    S. Baratella (2004). An Infinitary Variant of Metric Temporal Logic Over Dense Time Domains. Mathematical Logic Quarterly 50 (3):249.
    We introduce a complete and cut-free proof system for a sufficiently expressive fragment of Metric Temporal Logic over dense time domains in which a schema of induction is provable. So doing we extend results previously obtained by Montagna et al. to unbounded temporal operators.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  22
    Joeri Engelfriet & Jan Treur (2002). Linear, Branching Time and Joint Closure Semantics for Temporal Logic. Journal of Logic, Language and Information 11 (4):389-425.
    Temporal logic can be used to describe processes: their behaviour ischaracterized by a set of temporal models axiomatized by a temporaltheory. Two types of models are most often used for this purpose: linearand branching time models. In this paper a third approach, based onsocalled joint closure models, is studied using models which incorporateall possible behaviour in one model. Relations between this approach andthe other two are studied. In order to define constructions needed torelate branching time models, appropriate (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  9.  19
    Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini & Valentina Poggioni (2007). Linear Temporal Logic as an Executable Semantics for Planning Languages. 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 (5 more)  
     
    Export citation  
     
    My bibliography  
  10.  20
    Heinrich Wansing & Norihiro Kamide (2011). Synchronized Linear-Time Temporal Logic. Studia Logica 99 (1-3):365-388.
    A new combined temporal logic called synchronized linear-time temporal logic (SLTL) is introduced as a Gentzen-type sequent calculus. SLTL can represent the n -Cartesian product of the set of natural numbers. The cut-elimination and completeness theorems for SLTL are proved. Moreover, a display sequent calculus δ SLTL is defined.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  11.  3
    Franco Montagna, G. Michele Pinna & B. P. Tiezzi (2002). Investigations on Fragments of First Order Branching Temporal Logic. Mathematical Logic Quarterly 48 (1):51-62.
    We investigate axiomatizability of various fragments of first order computational tree logic showing that the fragments with the modal operator F are non axiomatizable. These results shows that the only axiomatizable fragment is the one with the modal operator next only.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  12.  34
    Marcelo Finger & Dov M. Gabbay (1992). Adding a Temporal Dimension to a Logic System. Journal of Logic, Language and Information 1 (3):203-233.
    We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  13.  22
    Joeri Engelfriet, Catholijn M. Jonker & Jan Treur (2002). Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic. Journal of Logic, Language and Information 11 (2):195-225.
    Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  14.  6
    F. Montagna, G. M. Pinna & E. B. Tiezzi (2000). A Cut-Free Proof System for Bounded Metric Temporal Logic Over a Dense Time Domain. Mathematical Logic Quarterly 46 (2):171-182.
    We present a complete and cut-free proof-system for a fragment of MTL, where modal operators are only labelled by bounded intervals with rational endpoints.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  15.  58
    Tomohiro Hoshi & Audrey Yap (2009). Dynamic Epistemic Logic with Branching Temporal Structures. Synthese 169 (2):259 - 281.
    van Bentham et al. (Merging frameworks for interaction: DEL and ETL, 2007) provides a framework for generating the models of Epistemic Temporal Logic ( ETL : Fagin et al., Reasoning about knowledge, 1995; Parikh and Ramanujam, Journal of Logic, Language, and Information, 2003) from the models of Dynamic Epistemic Logic ( DEL : Baltag et al., in: Gilboa (ed.) Tark 1998, 1998; Gerbrandy, Bisimulations on Planet Kripke, 1999). We consider the logic TDEL on the merged (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  16. Norihiro Kamide (2009). Temporal Non-Commutative Logic: Expressing Time, Resource, Order and Hierarchy. Logic and Logical Philosophy 18 (2):97-126.
    A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are shown for TN[l]. An advantage of TN[l] is its decidability, because the standard first-order linear-time temporal logic is undecidable. A correspondence theorem between TN[l] and (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  17.  16
    Sara L. Uckelman (2013). A Quantified Temporal Logic for Ampliation and Restriction. Vivarium 51 (1-4):485-510.
  18.  31
    Joeri Engelfriet & Jan Treur (1998). An Interpretation of Default Logic in Minimal Temporal Epistemic Logic. Journal of Logic, Language and Information 7 (3):369-388.
    When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  19.  29
    Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.
    We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages has good closure (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  20. Dov M. Gabbay & Hans Jürgen Ohlbach (1994). Temporal Logic First International Conference, Ictl '94, Bonn, Germany, July 11-14, 1994 : Proceedings'.
     
    Export citation  
     
    My bibliography  
  21.  29
    Anatoli Degtyarev, Michael Fisher & Alexei Lisitsa (2002). Equality and Monodic First-Order Temporal Logic. Studia Logica 72 (2):147-156.
    It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e., the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  22.  56
    Thomas Ågotnes (2006). Action and Knowledge in Alternating-Time Temporal Logic. Synthese 149 (2):375 - 407.
    Alternating-time temporal logic (ATL) is a branching time temporal logic in which statements about what coalitions of agents can achieve by strategic cooperation can be expressed. Alternating-time temporal epistemic logic (ATEL) extends ATL by adding knowledge modalities, with the usual possible worlds interpretation. This paper investigates how properties of agents’ actions can be expressed in ATL in general, and how properties of the interaction between action and knowledge can be expressed in ATEL in particular. (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  23.  51
    Seiki Akama, Yasunori Nagata & Chikatoshi Yamada (2008). Three-Valued Temporal Logic Q T and Future Contingents. 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  
     
    My bibliography   1 citation  
  24.  27
    Stefano Aguzzoli, Matteo Bianchi & Vincenzo Marra (2009). A Temporal Semantics for Basic Logic. Studia Logica 92 (2):147 - 162.
    In the context of truth-functional propositional many-valued logics, Hájek’s Basic Fuzzy Logic BL [14] plays a major rôle. The completeness theorem proved in [7] shows that BL is the logic of all continuous t -norms and their residua. This result, however, does not directly yield any meaningful interpretation of the truth values in BL per se . In an attempt to address this issue, in this paper we introduce a complete temporal semantics for BL. Specifically, we show (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  25.  24
    Walter Hussak (2008). Decidable Cases of First-Order Temporal Logic with Functions. Studia Logica 88 (2):247 - 261.
    We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  21
    Andrzej Indrzejczak (2003). A Labelled Natural Deduction System for Linear Temporal Logic. Studia Logica 75 (3):345 - 376.
    The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  27.  6
    V. Rybakov (2008). Discrete Linear Temporal Logic with Current Time Point Clusters, Deciding Algorithms. 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  
     
    My bibliography  
  28.  8
    Sergey Babenyshev & Vladimir Rybakov (2011). Unification in Linear Temporal Logic LTL. 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 (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  29.  1
    P. Blackburn & M. Tzakova (1999). Hybrid Languages and Temporal Logic. 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  
     
    My bibliography   10 citations  
  30.  4
    V. Rybakov (2008). Linear Temporal Logic with Until and Next, Logical Consecutions. 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 (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  31.  13
    Mark Reynolds (2010). The Complexity of Temporal Logic Over the Reals. 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 (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  32.  1
    Frank Wolter & Michael Zakharyaschev (2002). Axiomatizing the Monodic Fragment of First-Order Temporal Logic. Annals of Pure and Applied Logic 118 (1-2):133-145.
    It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic fragment is an exception by constructing its finite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  33.  9
    V. V. Rybakov (2005). Logical Consecutions in Discrete Linear Temporal Logic. Journal of Symbolic Logic 70 (4):1137 - 1149.
    We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be 'correct' in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈L, ≤, ≥〉 of all integer numbers, is the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  34.  22
    Mark Reynolds (1997). A Decidable Temporal Logic of Parallelism. 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  
     
    My bibliography   2 citations  
  35.  25
    Marcelo Finger & Dov Gabbay (1996). Combining Temporal Logic Systems. 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 (4 more)  
     
    Export citation  
     
    My bibliography  
  36.  2
    Clare Dixon, Alexander Bolotov & Michael Fisher (2005). Alternating Automata and Temporal Logic Normal Forms. 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 (3 more)  
     
    Export citation  
     
    My bibliography  
  37.  2
    C. Morgan & A. Mciver (1999). An Expectation-Transformer Model for Probabilistic Temporal Logic. Logic Journal of the Igpl 7 (6):779-804.
    We interpret the modal µ-calculus over a new model [10], to give a temporal logic suitable for systems exhibiting both probabilistic and demonic nondeterminism. The logical formulae are real-valued, and the statements are not limited to properties that hold with probability 1. In achieving that conceptual step, our technical contribution is to determine the correct quantitative generalisation of the Boolean operators: one that allows many of the standard Boolean-based temporal laws to carry over the reals with little (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  38.  50
    Giacomo Bonanno (2007). Axiomatic Characterization of the AGM Theory of Belief Revision in a Temporal Logic. Artificial Intelligence 171 (2-3):144-160.
    Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic (...)
    Direct download  
     
    Export citation  
     
    My bibliography   8 citations  
  39.  5
    Marcelo Finger & M. Weiss (2002). The Unrestricted Combination of Temporal Logic Systems. Logic Journal of the Igpl 10 (2):165-189.
    This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness and decidability for the temporalisation of logics T for any flow of time, eliminating the original restriction that required linear time for the transference of those properties through logic combination. We also generalise such results to the external application of a multi-modal system containing any number of connectives with arbitrary arity, that respect (...)
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  40.  45
    Mark Reynolds (1996). Axiomatising First-Order Temporal Logic: Until and Since Over Linear Time. Studia Logica 57 (2-3):279 - 302.
    We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved.We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  41.  8
    Janardan Misra & Suman Roy (2014). A Decidable Timeout-Based Extension of Linear Temporal Logic. Journal of Applied Non-Classical Logics 24 (3):262-291.
    We develop a timeout extension of propositional linear temporal logic to specify timing properties of timeout-based models of real-time systems. A timeout is used to model the execution of an action marking the end of a delay. With a view to expressing such timeout constraints, ToLTL uses a dynamic variable to abstract the timeout behaviour in addition to a variable which captures the global clock and some static timing variables which record time instances when discrete events occur. We (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  42.  30
    Donald L. M. Baxter (2000). A Humean Temporal Logic. The Proceedings of the Twentieth World Congress of Philosophy 2000 (Analytic Philosophy and Logic):209-216.
    Hume argues that the idea of duration is just the idea of the manner in which several things in succession are arrayed. In other words, the idea of duration is the idea of successiveness. He concludes that all and only successions have duration. Hume also argues that there is such a thing as a steadfast object—something which co-exists with many things in succession, but which is not itself a succession. Thus, it seems that Hume has committed himself to a contradiction: (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  43.  7
    Marcelo Finger (1992). Handling Database Updates in Two-Dimensional Temporal Logic. Journal of Applied Non-Classical Logics 2 (2):201-224.
    ABSTRACT We introduce a two-dimensional temporal logic as a formalism which enables the description of both the history of a world and the evolution of an observer's views about the history. We apply such formalism to the description of certain problems that occur in historical database systems due to updates. The historical dimension describes the history of a world according to an observer's view at a certain moment in time. The transaction dimension describes the evolution of an observer's (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  44.  6
    Alfredo Burrieza & Inma P. De Guzmán (1992). A New Algebraic Semantic Approach and Some Adequate Connectives for Computation with Temporal Logic Over Discrete Time. Journal of Applied Non-Classical Logics 2 (2):181-200.
    ABSTRACT In this paper we present a new semantic approach for propositional linear temporal logic with discrete time, strongly based in the well-order of IN (the set of natural numbers). We consider temporal connectives which express precedence, posteriority and simultaneity, and they provide a family of expressively complete temporal logics. The selection of the new semantics and connectives used in this work was principally to obtain a suitable executable temporal logic, which can be used (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  45.  11
    Bernd-Holger Schlingloff (1992). Expressive Completeness of Temporal Logic of Trees. 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  
     
    My bibliography  
  46.  5
    Regimantas Pliuskevicius (1998). Replacement of Induction by Similarity Saturation in a First Order Linear Temporal Logic. Journal of Applied Non-Classical Logics 8 (1-2):141-169.
    ABSTRACT A new type of calculi is proposed for a first order linear temporal logic. Instead of induction-type postulates the introduced calculi contain a similarity saturation principle, indicating some form of regularity in the derivations of the logic. In a finitary case we obtained the finite set of saturated sequents, showing that ?nothing new? can be obtained continuing the derivation process. Instead of the ?-type rule of inference, an infinitary saturated calculus has an infinite set of saturated (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  47.  4
    Nicholas Rescher (1971). Temporal Logic. New York,Springer-Verlag.
  48.  18
    Ullrich Hustadt (2001). Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 2, Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. [REVIEW] Journal of Logic, Language and Information 10 (3):406-410.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  49. Dov M. Gabbay, Ian Hodkinson & Mark Reynolds (1994). Temporal Logic Mathematical Foundations and Computational Aspects. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography   19 citations  
  50.  29
    Wiebe van der Hoek & Michael Wooldridge (2003). Cooperation, Knowledge, and Time: Alternating-Time Temporal Epistemic Logic and its Applications. Studia Logica 75 (1):125-157.
    Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal (...) (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   10 citations  
1 — 50 / 1000