Log in

Relevant bibliographies by topics / Temporal logic / Journal articles

Journal articles on the topic 'Temporal logic'

To see the other types of publications on this topic, follow the link: Temporal logic.

Author: Grafiati

Published: 4 June 2021

Last updated: 16 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Temporal logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Uckelman, Sara L., and Spencer Johnston. "John Buridan’s Sophismata and Interval Temporal Semantics." History of Philosophy and Logical Analysis 13, no. 1 (April 5, 2010): 131–47. http://dx.doi.org/10.30965/26664275-01301009.

Full text

Abstract:

In this paper we look at the suitability of modern interval-based temporal logic for modeling John Buridan’s treatment of tensed sentences in his Sophismata. Building on the paper (Øhrstrøm 1984), we develop Buridan’s analysis of temporal logic, paying particular attention to his notions of negation and the absolute/relative nature of the future and the past.We introduce a number of standard modern propositional interval temporal logics (ITLs) to illustrate where Buridan’s interval-based temporal analysis differs from the standard modern approaches. We give formal proofs of some claims in (Øhrstrøm 1984), and sketch how the standard modern systems could be defined in terms of Buridan’s proposals, showing that his logic can be taken as more basic. In diesem Aufsatz betrachten wir das Geeignetsein einer modernen intervallbasierten temporalen Logik für die Modellierung von John Buridans Behandlung zeitabhängiger Sätze in seinen Sophismata. Aufbauend auf den Aufsatz (Øhrstrøm 1984) stellen wir Buridans Analyse der temporalen Logik dar, mit besonderer Berücksichtigung seiner Begriffe der Negation und der absoluten/relativen Natur der Zukunft und der Vergangenheit. Wir führen einige standardmäßige moderne intervallbasierte temporale Aussagenlogiken (ITLs) ein, um zu illustrieren, wo Buridans intervallbasierte temporale Analyse von den standardmäßigen modernen Zugangsweisen abweicht. Wir geben formale Beweise einiger Behauptungen in (Øhrstrøm 1984) an und skizzieren, wie die standardmäßigen modernen Systeme im Sinne der Vorschläge Buridans definiert werden könnten; wir zeigen damit, dass seine Logik als die grundlegendere aufgefasst werden kann.

APA, Harvard, Vancouver, ISO, and other styles

2

Trzęsicki, Kazimierz. "Indeterministic Temporal Logic." Studies in Logic, Grammar and Rhetoric 42, no. 1 (September 1, 2015): 139–62. http://dx.doi.org/10.1515/slgr-2015-0034.

Full text

Abstract:

Abstract The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.

APA, Harvard, Vancouver, ISO, and other styles

3

Long, Derek. "A review of temporal logics." Knowledge Engineering Review 4, no. 2 (June 1989): 141–62. http://dx.doi.org/10.1017/s0269888900004896.

Full text

Abstract:

AbstractA series of temporal reasoning tasks are identified which motivate the consideration and application of temporal logics in artificial intelligence. There follows a discussion of the broad issues involved in modelling time and constructing a temporal logic. The paper then presents a detailed review of the major approaches to temporal logics: first-order logic approaches, modal temporal logics and reified temporal logics. The review considers the most significant exemplars within the various approaches, including logics due to Russell, Hayes and McCarthy, Prior, McDermott, Allen, Kowalski and Sergot. The logics are compared and contrasted, particularly in their treatments of change and action, the roles they seek to fulfil and the underlying models of time on which they rest. The paper concludes with a brief consideration of the problem of granularity—a problem of considerable significance in temporal reasoning, which has yet to be satisfactorily treated in a temporal logic.

APA, Harvard, Vancouver, ISO, and other styles

4

von KARGER, BURGHARD. "Temporal algebra." Mathematical Structures in Computer Science 8, no. 3 (June 1998): 277–320. http://dx.doi.org/10.1017/s0960129598002540.

Full text

Abstract:

We develop temporal logic from the theory of complete lattices, Galois connections and fixed points. In particular, we prove that all seventeen axioms of Manna and Pnueli's sound and complete proof system for linear temporal logic can be derived from just two postulates, namely that ([oplus ], &[ominus ]tilde;) is a Galois connection and that ([ominus ], [oplus ]) is a perfect Galois connection. We also obtain a similar result for the branching time logic CTL.A surprising insight is that most of the theory can be developed without the use of negation. In effect, we are studying intuitionistic temporal logic. Several examples of such structures occurring in computer science are given. Finally, we show temporal algebra at work in the derivation of a simple graph-theoretic algorithm.This paper is tutorial in style and there are no difficult technical results. To the experts in temporal logics, we hope to convey the simplicity and beauty of algebraic reasoning as opposed to the machine-orientedness of logical deduction. To those familiar with the calculational approach to programming, we want to show that their methods extend easily and smoothly to temporal reasoning. For anybody else, this text may serve as a gentle introduction to both areas.

APA, Harvard, Vancouver, ISO, and other styles

5

Uckelman, Sara L. "A Quantified Temporal Logic for Ampliation and Restriction." Vivarium 51, no. 1-4 (2013): 485–510. http://dx.doi.org/10.1163/15685349-12341259.

Full text

Abstract:

Abstract 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 theories of supposition. As a case study, we look at the supposition theory of Lambert of Lagny (Auxerre), extracting from it a temporal logic and providing a formalization of that logic.

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Nan, Zhenhua Duan, and Cong Tian. "Unified temporal logic." Theoretical Computer Science 864 (April 2021): 58–69. http://dx.doi.org/10.1016/j.tcs.2021.02.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bucheli, Samuel, Meghdad Ghari, and Thomas Studer. "Temporal Justification Logic." Electronic Proceedings in Theoretical Computer Science 243 (March 6, 2017): 59–74. http://dx.doi.org/10.4204/eptcs.243.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

van Glabbeek, Rob. "Reactive Temporal Logic." Electronic Proceedings in Theoretical Computer Science 322 (August 27, 2020): 51–68. http://dx.doi.org/10.4204/eptcs.322.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Abadi, Martín, and Zohar Manna. "Temporal logic programming." Journal of Symbolic Computation 8, no. 3 (September 1989): 277–95. http://dx.doi.org/10.1016/s0747-7171(89)80070-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Garanina, Natalia Olegovna, Igor Sergeevich Anureev, Vladimir Evgenyevich Zyubin, Sergey Mikhailovich Staroletov, Tatiana Victorovna Liakh, Andrey Sergeevich Rozov, and Sergei Petrovich Gorlatch. "Temporal Logic for Programmable Logic Controllers." Modeling and Analysis of Information Systems 27, no. 4 (December 20, 2020): 412–27. http://dx.doi.org/10.18255/1818-1015-2020-4-412-427.

Full text

Abstract:

We address the formal verification of the control software of critical systems, i.e., ensuring the absence of design errors in a system with respect to requirements. Control systems are usually based on industrial controllers, also known as Programmable Logic Controllers (PLCs). A specific feature of a PLC is a scan cycle: 1) the inputs are read, 2) the PLC states change, and 3) the outputs are written. Therefore, in order to formally verify PLC, e.g., by model checking, it is necessary to describe the transition system taking into account this specificity and reason both in terms of state transitions within a cycle and in terms of larger state transitions according to the scan-cyclic semantics. We propose a formal PLC model as a hyperprocess transition system and temporal cycle-LTL logic based on LTL logic for formulating PLC property. A feature of the cycle-LTL logic is the possibility of viewing the scan cycle in two ways: as the effect of the environment (in particular, the control object) on the control system and as the effect of the control system on the environment. For both cases we introduce modified LTL temporal operators. We also define special modified LTL temporal operators to specify inside properties of scan cycles. We describe the translation of formulas of cycle-LTL into formulas of LTL, and prove its correctness. This implies the possibility ofmodel checking requirements expressed in logic cycle-LTL, by using well-known model checking tools with LTL as specification logic, e.g., Spin. We give the illustrative examples of requirements expressed in the cycle-LTL logic.

APA, Harvard, Vancouver, ISO, and other styles

11

NISSAN, EPHRAIM. "Special Issue: Temporal Logic in Engineering." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 13, no. 2 (April 1999): 65. http://dx.doi.org/10.1017/s0890060499132013.

Full text

Abstract:

Logic-based models are thriving within artificial intelligence. A great number of new logics have been defined, and their theory investigated. Epistemic logics introduce modal operators for knowledge or belief; deontic logics are about norms, and introduce operators of deontic necessity and possibility (i.e., obligation or prohibition). And then we have a much investigated class—temporal logics—to whose application to engineering this special issue is devoted. This kind of formalism deserves increased widespread recognition and application in engineering, a domain where other kinds of temporal models (e.g., Petri nets) are by now a fairly standard part of the modelling toolbox.

APA, Harvard, Vancouver, ISO, and other styles

12

Maggi, Fabrizio M., Marco Montali, and Rafael Peñaloza. "Temporal Logics Over Finite Traces with Uncertainty." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 06 (April 3, 2020): 10218–25. http://dx.doi.org/10.1609/aaai.v34i06.6583.

Full text

Abstract:

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of uncertainty which cannot be handled with classical logics. We thus propose a new probabilistic temporal logic over finite traces using superposition semantics, where all possible evolutions are possible, until observed. We study the properties of the logic and provide automata-based mechanisms for deriving probabilistic inferences from its formulas. We then study a fragment of the logic with better computational properties. Notably, formulas in this fragment can be discovered from event log data using off-the-shelf existing declarative process discovery techniques.

APA, Harvard, Vancouver, ISO, and other styles

13

Alpern, Bowen, and Fred B. Schneider. "Verifying temporal properties without temporal logic." ACM Transactions on Programming Languages and Systems 11, no. 1 (January 1989): 147–67. http://dx.doi.org/10.1145/59287.62028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Rybakov, V. V. "Logical consecutions in discrete linear temporal logic." Journal of Symbolic Logic 70, no. 4 (December 2005): 1137–49. http://dx.doi.org/10.2178/jsl/1129642119.

Full text

Abstract:

AbstractWe 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 prime object of our investigation. We describe consecutions admissible in LDTL in a semantic way—via consecutions valid in special temporal Kripke/Hintikka models. Then we state that any temporal inference rule has a reduced normal form which is given in terms of uniform formulas of temporal degree 1. Using these facts and enhanced semantic techniques we construct an algorithm, which recognizes consecutions admissible in LDTL. Also, we note that using the same technique it follows that the linear temporal logic L(N) of all natural numbers is also decidable w.r.t. inference rules. So, we prove that both logics LDTL and L(N) are decidable w.r.t. admissible consecutions. In particular, as a consequence, they both are decidable (known fact), and the given deciding algorithms are explicit.

APA, Harvard, Vancouver, ISO, and other styles

15

Xiong, Liping, and Sumei Guo. "Representation and Reasoning about Strategic Abilities with ω-Regular Properties." Mathematics 9, no. 23 (November 27, 2021): 3052. http://dx.doi.org/10.3390/math9233052.

Full text

Abstract:

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this problem, in this paper, based on linear dynamic logic (LDL), proposed by Moshe Y. Vardi, we propose LDL-based Strategy Logic (LDL-SL). Interpreted on concurrent game structures, LDL-SL extends SL, which contains existential/universal quantification operators about regular expressions. Here we adopt a branching-time version. This logic can express general ω-regular properties and describe more programmed constraints about individual/group strategies. Then we study three types of fragments (i.e., one-goal, ATL-like, star-free) of LDL-SL. Furthermore, we show that prevalent strategic logics based on LTL/CTL*, such as SL/ATL*, are exactly equivalent with those corresponding star-free strategic logics, where only star-free regular expressions are considered. Moreover, results show that reasoning complexity about the model-checking problems for these new logics, including one-goal and ATL-like fragments, is not harder than those of corresponding SL or ATL*.

APA, Harvard, Vancouver, ISO, and other styles

16

Walker, Matt, Parssa Khazra, Anto Nanah Ji, Hongru Wang, and Franck van Breugel. "jpf-logic." ACM SIGSOFT Software Engineering Notes 48, no. 1 (January 10, 2023): 32–36. http://dx.doi.org/10.1145/3573074.3573083.

Full text

Abstract:

We present jpf-logic, an extension of the model checker Java PathFinder (JPF). Our extension jpf-logic provides a framework to check properties expressed in temporal logics such as linear temporal logic (LTL) and computation tree logic (CTL). To support a logic in our framework, we (1) implement a parser for the logic, (2) develop a hierarchy of classes that represent the abstract syntax of the logic and implement a transformation from parse trees of formulas to the corresponding abstract syntax trees, and (3) implement a model checking algorithm that takes as input an abstract syntax tree of a formula and a partial transition system. The latter represents a model of the Java application. All three components have been implemented for CTL. The first two have been implemented for LTL.

APA, Harvard, Vancouver, ISO, and other styles

17

Garanina, N. O., I. S. Anureev, V. E. Zyubin, S. M. Staroletov, T. V. Liakh, A. S. Rozov, and S. P. Gorlatch. "A Temporal Logic for Programmable Logic Controllers." Automatic Control and Computer Sciences 55, no. 7 (December 2021): 763–75. http://dx.doi.org/10.3103/s0146411621070038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Artale, A., and E. Franconi. "A Temporal Description Logic for Reasoning about Actions and Plans." Journal of Artificial Intelligence Research 9 (December 1, 1998): 463–506. http://dx.doi.org/10.1613/jair.516.

Full text

Abstract:

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL -- able to express interval temporal networks -- together with the non-temporal logic F -- a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.

APA, Harvard, Vancouver, ISO, and other styles

19

Kröger, Fred, and Stephan Merz. "Temporal Logic and Recursion." Fundamenta Informaticae 14, no. 2 (February 1, 1991): 261–81. http://dx.doi.org/10.3233/fi-1991-14207.

Full text

Abstract:

We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.

APA, Harvard, Vancouver, ISO, and other styles

20

Halpern, Joseph Y., and B. C. Moszkowski. "Executing Temporal Logic Programs." Journal of Symbolic Logic 53, no. 1 (March 1988): 309. http://dx.doi.org/10.2307/2274451.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Moon, S., K. H. Lee, and D. Lee. "Fuzzy Branching Temporal Logic." IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 34, no. 2 (April 2004): 1045–55. http://dx.doi.org/10.1109/tsmcb.2003.819485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Seotsanyana, Motlatsi. "Temporal Logic Motion Planning." Defence Science Journal 60, no. 1 (January 24, 2010): 23–38. http://dx.doi.org/10.14429/dsj.60.99.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Shakarian, Paulo, Gerardo I. Simari, and V. S. Subrahmanian. "Annotated Probabilistic Temporal Logic." ACM Transactions on Computational Logic 13, no. 2 (April 2012): 1–33. http://dx.doi.org/10.1145/2159531.2159535.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Shakarian, Paulo, Austin Parker, Gerardo Simari, and Venkatramana V. S. Subrahmanian. "Annotated probabilistic temporal logic." ACM Transactions on Computational Logic 12, no. 2 (January 2011): 1–44. http://dx.doi.org/10.1145/1877714.1877720.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Duan, Zhenhua, Xiaoxiao Yang, and Maciej Koutny. "Framed temporal logic programming." Science of Computer Programming 70, no. 1 (January 2008): 31–61. http://dx.doi.org/10.1016/j.scico.2007.09.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Alur, Rajeev, Thomas A. Henzinger, and Orna Kupferman. "Alternating-time temporal logic." Computer Standards & Interfaces 21, no. 2 (June 1999): 142. http://dx.doi.org/10.1016/s0920-5489(99)92088-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Vasile, Cristian-Ioan, Derya Aksaray, and Calin Belta. "Time window temporal logic." Theoretical Computer Science 691 (August 2017): 27–54. http://dx.doi.org/10.1016/j.tcs.2017.07.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gergatsoulis, Manolis, Panos Rondogiannis, and Themis Panayiotopoulos. "Temporal disjunctive logic programming." New Generation Computing 19, no. 1 (March 2001): 87–100. http://dx.doi.org/10.1007/bf03037535.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Fisher, Michael. "Temporal logic of programs." Science of Computer Programming 10, no. 2 (April 1988): 215–16. http://dx.doi.org/10.1016/0167-6423(88)90030-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Reynolds, Mark. "Metric temporal logic revisited." Acta Informatica 53, no. 3 (June 13, 2015): 301–24. http://dx.doi.org/10.1007/s00236-015-0243-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Finger, Marcelo, and Dov Gabbay. "Combining Temporal Logic Systems." Notre Dame Journal of Formal Logic 37, no. 2 (April 1996): 204–32. http://dx.doi.org/10.1305/ndjfl/1040046087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Engelfriet, Joeri. "Minimal Temporal Epistemic Logic." Notre Dame Journal of Formal Logic 37, no. 2 (April 1996): 233–59. http://dx.doi.org/10.1305/ndjfl/1040046088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Alur, Rajeev, Thomas A. Henzinger, and Orna Kupferman. "Alternating-time temporal logic." Journal of the ACM 49, no. 5 (September 2002): 672–713. http://dx.doi.org/10.1145/585265.585270.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ma, J. "A Reified Temporal Logic." Computer Journal 39, no. 9 (September 1, 1996): 800–807. http://dx.doi.org/10.1093/comjnl/39.9.800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Alur, Rajeev, and Thomas A. Henzinger. "A really temporal logic." Journal of the ACM 41, no. 1 (January 2, 1994): 181–203. http://dx.doi.org/10.1145/174644.174651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Norgėla, S., and L. Skripkauskas. "On temporal logic S4Dbr." Lithuanian Mathematical Journal 46, no. 2 (April 2006): 163–72. http://dx.doi.org/10.1007/s10986-006-0020-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Bozzelli, Laura, and César Sánchez. "Visibly Linear Temporal Logic." Journal of Automated Reasoning 60, no. 2 (March 11, 2017): 177–220. http://dx.doi.org/10.1007/s10817-017-9410-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Katz, Shmuel, and Doron Peled. "Interleaving set temporal logic." Theoretical Computer Science 75, no. 3 (October 1990): 263–87. http://dx.doi.org/10.1016/0304-3975(90)90096-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Nogueira, Vitor, and Salvador Abreu. "Temporal Contextual Logic Programming." Electronic Notes in Theoretical Computer Science 177 (June 2007): 219–33. http://dx.doi.org/10.1016/j.entcs.2007.01.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

PENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (March 1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.

Full text

Abstract:

We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTL P, interpreted over Mazurkiewicz’s trace systems. The logic is powerful enough to express most of the partial order properties of distributed systems like serializability of database transactions, snapshots, parallel execution of program segments, or inevitability under concurrency fairness assumption. We show that the model checking problem for the logic is NP-hard, even if past modalities cannot be nested. Then, we give a one exponential time model checking algorithm for the logic without nested past modalities. We show that all the interesting partial order properties can be model checked using our algorithm. Next, we show that is is possible to extend the model checking algorithm to cover the whole language and its extension to [Formula: see text]. Finally, we prove that the logic is undecidable and we discuss consequences of our results on using propositional versions of partial order temporal logics to synthesis of concurrent systems from their specifications.

APA, Harvard, Vancouver, ISO, and other styles

41

BOUDOU, JOSEPH, MARTÍN DIÉGUEZ, DAVID FERNÁNDEZ-DUQUE, and PHILIP KREMER. "Exploring the Jungle of Intuitionistic Temporal Logics." Theory and Practice of Logic Programming 21, no. 4 (April 22, 2021): 459–92. http://dx.doi.org/10.1017/s1471068421000089.

Full text

Abstract:

AbstractThe importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible to extend functional programming languages with new features via type theory, while from the semantics perspective, several logics for reasoning about dynamical systems and several semantics for logic programming have their roots in this framework. We consider several axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. We provide two distinct interpretations of “henceforth”, both of which are natural intuitionistic variants of the classical one. We completely establish the order relation between the semantically defined logics based on both interpretations of “henceforth” and, using our soundness results, show that the axiomatically defined logics enjoy the same order relations.

APA, Harvard, Vancouver, ISO, and other styles

42

JACOBS, BART. "The temporal logic of coalgebras via Galois algebras." Mathematical Structures in Computer Science 12, no. 6 (December 2002): 875–903. http://dx.doi.org/10.1017/s096012950200378x.

Full text

Abstract:

This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how ‘fuzzy’ predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner.

APA, Harvard, Vancouver, ISO, and other styles

43

Surowik, Dariusz. "Minimal Systems of Temporal Logic." Axioms 9, no. 2 (June 16, 2020): 67. http://dx.doi.org/10.3390/axioms9020067.

Full text

Abstract:

The article discusses minimal temporal logic systems built on the basis of classical logic as well as intuitionistic logic. The constructions of these systems are discussed as well as their basic properties. The K t system was discussed as the minimal temporal logic system built based on classical logic, while the IK t system and its modification were discussed as the minimal temporal logic system built based on intuitionistic logic.

APA, Harvard, Vancouver, ISO, and other styles

44

Маркин, В. И. "What trends in non-classical logic were anticipated by Nikolai Vasiliev?" Logical Investigations 19 (April 9, 2013): 122–35. http://dx.doi.org/10.21146/2074-1472-2013-19-0-122-135.

Full text

Abstract:

In this paper we discuss a question about the trends in non-classical logic that were exactly anticipated by Niko- lai Vasiliev. We show the influence of Vasiliev’s Imaginary logic on paraconsistent logic. Metatheoretical relations between Vasiliev’s logical systems and many-valued predicate logics are established. We also make clear that Vasiliev has developed a sketch of original system of intensional logic and expressed certain ideas of modal and temporal logics.

APA, Harvard, Vancouver, ISO, and other styles

45

Котикова, Е. А., and М. Н. Рыбаков. "Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics." Logical Investigations 21, no. 1 (April 21, 2015): 86–99. http://dx.doi.org/10.21146/2074-1472-2015-21-1-86-99.

Full text

Abstract:

We study an expressive power of temporal operators used in such logics of branching time as computational tree logic or alternating-time temporal logic. To do this we investigate calculi in the first-order language enriched with the temporal operators used in such logics. We show that the resulting languages are so powerful that many ‘natural’ calculi in the languages are not Kripke complete; for example, if a calculus in such language is correct with respect to the class of all serial linear Kripke frames (even just with constant domains) then it is not Kripke complete. Some near questions are discussed.

APA, Harvard, Vancouver, ISO, and other styles

46

Moszkowski, B. "Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals." Journal of Logic and Computation 17, no. 2 (April 1, 2007): 333–409. http://dx.doi.org/10.1093/logcom/exm006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Bochman, Alexander. "Concerted instant-interval temporal semantics. I. Temporal ontologies." Notre Dame Journal of Formal Logic 31, no. 3 (June 1990): 403–14. http://dx.doi.org/10.1305/ndjfl/1093635505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Shi, Hui-Xian, and Yong-Ming Li. "Temporal normal form for Linear Temporal Logic formulae1." Journal of Intelligent & Fuzzy Systems 30, no. 3 (March 1, 2016): 1657–62. http://dx.doi.org/10.3233/ifs-151874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Reznichenko, V. A., and I. S. Chystiakova. "Table interpretation of the temporal description logic LTLALC." PROBLEMS IN PROGRAMMING, no. 3-4 (December 2022): 216–30. http://dx.doi.org/10.15407/pp2022.03-04.216.

Full text

Abstract:

Description logics are widely used to describe and represent knowledge in the Semantic Web. This is a modern and powerful mechanism that provides the possibility of extracting knowledge from already existing ones. Thanks to this, conceptual of subject areas modeling has become one of the fields of application of descriptive logics, taking into account the use of inference mechanisms. Conceptual modeling is used to create databases and knowledge bases. A key issue of the subject area modeling is the ability to monitor the dynamics of changes in the state of the subject area over time. It is necessary to describe not only the current actual state of the database (knowledge bases), but also the background. Temporal descriptive logics are used to solve this problem. They have the same set of algorithmic problems that are presented in conventional descriptive logics, but to them are added questions related to the description of knowledge in time. This refers to the form of time (continuous or discrete), time structure (moments of time, intervals, chains of intervals), time linearity (linear or branched), domain (present, past, future), the concept of “now”, the method of measurement, etc. An urgent task today is to create an algorithm for the temporal interpretation of conventional descriptive logics. That is, to show a way in which temporal descriptive logic can be applied to ordinary descriptive logic. The paper presents an algorithm for temporal interpretation of LTL into ALC. Linear, unbranched time is chosen for the description goal. It is presented in the form of a whole temporal axis with a given linear order on it. Only the future tense is considered. The algorithm contains graphic notations of LTL application in ALC: concepts, concept constructors, roles, role constructors, TBox and ABox. Numerous examples are used to illustrate the application of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

50

AGUADO, FELICIDAD, PEDRO CABALAR, GILBERTO PÉREZ, CONCEPCIÓN VIDAL, and MARTÍN DIÉGUEZ. "Temporal logic programs with variables." Theory and Practice of Logic Programming 17, no. 2 (November 11, 2016): 226–43. http://dx.doi.org/10.1017/s1471068416000570.

Full text

Abstract:

AbstractIn this note, we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic, an extension of Answer Set Programming for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of Temporal Equilibrium Logic that shares the syntax of first-order Linear-time Temporal Logic but has different semantics, selecting some Linear-time Temporal Logic models we call temporal stable models. Then, we consider a subclass of theories (called splittable temporal logic programs) that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of safe variables that suffices to show the property of domain independence – that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard Answer Set Programming grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!