Log in

Relevant bibliographies by topics / Interval temporal logic / Journal articles

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

Journal articles on the topic 'Interval temporal logic'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

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 'Interval 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 (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 (Øhr

APA, Harvard, Vancouver, ISO, and other styles

2

Di Giampaolo, Barbara, Salvatore La Torre, and Margherita Napoli. "Parametric metric interval temporal logic." Theoretical Computer Science 564 (January 2015): 131–48. http://dx.doi.org/10.1016/j.tcs.2014.11.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kosiuczenko, Piotr. "An Interval Temporal Logic for Time Series Specification and Data Integration." Remote Sensing 13, no. 12 (2021): 2236. http://dx.doi.org/10.3390/rs13122236.

Full text

Abstract:

The analysis of temporal series—in particular, analysis of multisensor data—is a complex problem. It depends on the application domain, the way the data have to be used, and sensors available, among other factors. Various models, algorithms, and technologies have been designed for this goal. Temporal logics are used to describe temporal properties of systems. The properties may specify the occurrence and the order of events in time, recurring patterns, complex behaviors, and processes. In this paper, a new interval logic, called duration calculus for functions (DC4F), is proposed for the speci

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ferrari, Luca. "Dyck Algebras, Interval Temporal Logic, and Posets of Intervals." SIAM Journal on Discrete Mathematics 30, no. 4 (2016): 1918–37. http://dx.doi.org/10.1137/15m1016904.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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 lan

APA, Harvard, Vancouver, ISO, and other styles

7

BRESOLIN, DAVIDE, PIETRO SALA, and GUIDO SCIAVICCO. "ON BEGINS, MEETS AND BEFORE." International Journal of Foundations of Computer Science 23, no. 03 (2012): 559–83. http://dx.doi.org/10.1142/s012905411240028x.

Full text

Abstract:

Interval temporal logics (ITLs) are logics for reasoning about temporal statements expressed over intervals, i.e., periods of time. The most famous temporal logic for intervals studied so far is probably Halpern and Shoham's HS, which is the logic of the thirteen Allen's interval relations. Unfortunately, HS and most of its fragments are undecidable. This discouraged the research in this area until recently, when a number non-trivial decidable ITLs have been discovered. This paper is a contribution towards the complete classification of all different fragments of HS. We consider here different

APA, Harvard, Vancouver, ISO, and other styles

8

Goranko, Valentin, Angelo Montanari, and Guido Sciavicco. "Propositional Interval Neighborhood Temporal Logics." JUCS - Journal of Universal Computer Science 9, no. (9) (2003): 1137–67. https://doi.org/10.3217/jucs-009-09-1137.

Full text

Abstract:

Logics for time intervals provide a natural framework for dealing with time in various areas of computer science and artificial intelligence, such as planning, natural language processing, temporal databases, and formal specification. In this paper we focus our attention on propositional interval temporal logics with temporal modalities for neighboring intervals over linear orders. We study the class of propositional neigh-borhood logics (PNL) over two natural semantics, respectively admitting and excluding point-intervals. First, we introduce interval neighborhood frames and we provide repres

APA, Harvard, Vancouver, ISO, and other styles

9

Montanari, Angelo, and Pietro Sala. "Reactive synthesis from interval temporal logic specifications." Theoretical Computer Science 899 (January 2022): 48–79. http://dx.doi.org/10.1016/j.tcs.2021.11.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Klaudel, Hanna, Maciej Koutny, Zhenhua Duan, and Ben Moszkowski. "From Box Algebra to Interval Temporal Logic." Fundamenta Informaticae 167, no. 4 (2019): 323–54. http://dx.doi.org/10.3233/fi-2019-1820.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bozzelli, Laura, and Adriano Peron. "Parametric Interval Temporal Logic over Infinite Words." Electronic Proceedings in Theoretical Computer Science 370 (September 20, 2022): 97–113. http://dx.doi.org/10.4204/eptcs.370.7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Bozzelli, Laura, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala. "Interval vs. Point Temporal Logic Model Checking." ACM Transactions on Computational Logic 20, no. 1 (2019): 1–31. http://dx.doi.org/10.1145/3281028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zaidi, Abbas K., and Lee W. Wagenhals. "Planning temporal events using point–interval logic." Mathematical and Computer Modelling 43, no. 9-10 (2006): 1229–53. http://dx.doi.org/10.1016/j.mcm.2005.05.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

ALLEN, JAMES F., and GEORGE FERGUSON. "Actions and Events in Interval Temporal Logic." Journal of Logic and Computation 4, no. 5 (1994): 531–79. http://dx.doi.org/10.1093/logcom/4.5.531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Jobczyk, Krystian. "A Multi-Valued Simplified Halpern–Shoham–Moszkowski Logic for Gradable Verifiability in Reasoning about Digital Circuits." Electronics 10, no. 15 (2021): 1817. http://dx.doi.org/10.3390/electronics10151817.

Full text

Abstract:

In 1983, B. Moszkowski introduced a first interval-interpreted temporal logic system, the so-called Interval Temporal Logic (ITL), as a system suitable to express mutual relations inside intervals for reasonings about digital circuits. In 1991, Halpern and Shoham proposed a new temporal system (HS) to describe external relations between intervals. This paper is aimed at proposing a basis-type combination of HS and a simplified ITL end extends it towards a multi-valued system—also capable of rendering a gradable justification of agents in a similar contexts of reasoning about digital circuits.

APA, Harvard, Vancouver, ISO, and other styles

16

Chuang Lin, Zhiguang Shan, Ting Liu, Yang Qu, and Fengyuan Ren. "Modeling and inference of extended interval temporal logic for nondeterministic intervals." IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 35, no. 5 (2005): 682–96. http://dx.doi.org/10.1109/tsmca.2005.851128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Bochman, Alexander. "Concerted instant-interval temporal semantics. II. Temporal valuations and logics of change." Notre Dame Journal of Formal Logic 31, no. 4 (1990): 580–601. http://dx.doi.org/10.1305/ndjfl/1093635593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Hornos, Miguel. "FBT: A Tool for Applying Interval Logic Specifications to On-the-fly Model Checking." JUCS - Journal of Universal Computer Science 10, no. (11) (2004): 1498–518. https://doi.org/10.3217/jucs-010-11-1498.

Full text

Abstract:

This paper presents the FBT (FIL to Buechi automaton Translator) tool which automatically translates any formula from FIL (Future Interval Logic) into its semantically equivalent Buechi automaton. There are two advantages of using this logic for specifying and verifying system properties instead of other more traditional and extended temporal logics, such as LTL (Linear Temporal Logic): firstly, it allows a succinct construction of specific temporal contexts, where certain properties must be evaluated, thanks to its key element, the interval, and secondly, it also permits a natural, intuitive,

APA, Harvard, Vancouver, ISO, and other styles

19

Rui Yang, and Xiaoju Ning. "Model Checking Cryptographic Protocols with Interval Temporal Logic." Journal of Convergence Information Technology 5, no. 10 (2010): 149–58. http://dx.doi.org/10.4156/jcit.vol5.issue10.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Rojas, Eddy M., and Amlan Mukherjee. "Interval Temporal Logic in General-Purpose Situational Simulations." Journal of Computing in Civil Engineering 19, no. 1 (2005): 83–93. http://dx.doi.org/10.1061/(asce)0887-3801(2005)19:1(83).

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Das, S. K., and P. Hammond. "Managing tasks using an interval-based temporal logic." Applied Intelligence 6, no. 4 (1996): 311–23. http://dx.doi.org/10.1007/bf00132736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

YANG, XIAOXIAO, ZHENHUA DUAN, and QIAN MA. "Axiomatic semantics of projection temporal logic programs." Mathematical Structures in Computer Science 20, no. 5 (2010): 865–914. http://dx.doi.org/10.1017/s0960129510000241.

Full text

Abstract:

In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules. In order to deduce a program over an interval, we also formalise a set of rules in terms of a Hoare logic-like triple. These rules enable us to deduce a program into its normal form and from the current state to the next one. They also enable us to verify properties over intervals. In this way, an

APA, Harvard, Vancouver, ISO, and other styles

23

Bresolin, Davide, Joanna Golińska-Pilarek, and Ewa Orlowska. "Relational dual tableaux for interval temporal logics ★." Journal of Applied Non-Classical Logics 16, no. 3-4 (2006): 251–77. http://dx.doi.org/10.3166/jancl.16.251-277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Tsai, Grace, Matt Insall, and Bruce McMillin. "Constructing an Interval Temporal Logic for Real-Time System." IFAC Proceedings Volumes 29, no. 6 (1996): 43–49. http://dx.doi.org/10.1016/s1474-6670(17)43744-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Zhang, Juan, and Fenfei Gu. "Detection of Back Attack based on Interval Temporal Logic." Journal of Physics: Conference Series 1550 (May 2020): 032164. http://dx.doi.org/10.1088/1742-6596/1550/3/032164.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bresolin, Davide, Agi Kurucz, Emilio Muñoz-Velasco, Vladislav Ryzhikov, Guido Sciavicco, and Michael Zakharyaschev. "Horn Fragments of the Halpern-Shoham Interval Temporal Logic." ACM Transactions on Computational Logic 18, no. 3 (2017): 1–39. http://dx.doi.org/10.1145/3105909.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Allen, James F., and Patrick J. Hayes. "Moments and points in an interval-based temporal logic." Computational Intelligence 5, no. 3 (1989): 225–38. http://dx.doi.org/10.1111/j.1467-8640.1989.tb00329.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

ARTALE, ALESSANDRO, and ENRICO FRANCONI. "Representing a robotic domain using temporal description logics." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 13, no. 2 (1999): 105–17. http://dx.doi.org/10.1017/s0890060499132050.

Full text

Abstract:

A temporal logic for representing and reasoning on a robotic domain 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 language is a member of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The logic is used to organize the domain actions and plans in a taxonomy. The classification and recognition tasks, together with the subsumption task form the basis for action management. An a

APA, Harvard, Vancouver, ISO, and other styles

29

Gómez, Rodolfo, and Howard Bowman. "PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic." Journal of Applied Non-Classical Logics 14, no. 1-2 (2004): 105–48. http://dx.doi.org/10.3166/jancl.14.105-148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Monica, Dario, Valentin Goranko, and Angelo Montanari. "Crossing the Undecidability Border with Extensions of Propositional Neighborhood Logic over Natural Numbers." JUCS - Journal of Universal Computer Science 18, no. (20) (2012): 2798–831. https://doi.org/10.3217/jucs-018-20-2798.

Full text

Abstract:

Propositional Neighborhood Logic (PNL) is an interval temporal logic featuring two modalities corresponding to the relations of right and left neighborhood between two intervals on a linear order (in terms of Allen's relations, meets/ and met by). Recently, it has been shown that PNL interpreted over several classes of linear orders, including natural numbers, is decidable (NEXPTIME-complete) and that some of its natural extensions preserve decidability. Most notably, this is the case with PNL over natural numbers extended with a limited form of metric constraints and with the future fragment

APA, Harvard, Vancouver, ISO, and other styles

31

Sciavicco, Guido. "Reasoning with Time Intervals: A Logical and Computational Perspective." ISRN Artificial Intelligence 2012 (October 14, 2012): 1–19. http://dx.doi.org/10.5402/2012/616087.

Full text

Abstract:

The role of time in artificial intelligence is extremely important. Interval-based temporal reasoning can be seen as a generalization of the classical point-based one, and the first results in this field date back to Hamblin (1972) and Benhtem (1991) from the philosophical point of view, to Allen (1983) from the algebraic and first-order one, and to Halpern and Shoham (1991) from the modal logic one. Without purporting to provide a comprehensive survey of the field, we take the reader to a journey through the main developments in modal and first-order interval temporal reasoning over the past

APA, Harvard, Vancouver, ISO, and other styles

32

Nazier Mosaad, Peter, Martin Fränzle, and Bai Xue. "Model Checking Delay Differential Equations Against Metric Interval Temporal Logic." Scientific Annals of Computer Science 27, no. 1 (2017): 77–109. http://dx.doi.org/10.7561/sacs.2017.1.77.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Bresolin, Davide, Pietro Sala, and Guido Sciavicco. "Begin, After, and Later: a Maximal Decidable Interval Temporal Logic." Electronic Proceedings in Theoretical Computer Science 25 (June 9, 2010): 72–88. http://dx.doi.org/10.4204/eptcs.25.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Molinari, Alberto, Angelo Montanari, and Adriano Peron. "Constraining Cycle Alternations in Model Checking for Interval Temporal Logic." Electronic Notes in Theoretical Computer Science 322 (April 2016): 211–26. http://dx.doi.org/10.1016/j.entcs.2016.03.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Mosaad, Peter Nazier, Martin Fränzle, and Bai Xue. "Model Checking Delay Differential Equations Against Metric Interval Temporal Logic." Scientific Annals of Computer Science XXVII, no. 1 (2017): 77–109. https://doi.org/10.7561/SACS.2017.1.77.

Full text

Abstract:

Delay differential equations (DDEs) play an important role in the modeling of dynamic processes. Delays arise in contemporary control schemes like networked distributed control and can cause deterioration of control performance, invalidating both stability and safety properties. This induces an interest in DDE especially in the area of modeling and verification of embedded control. In this article, we present an approach aiming at automatic safety verification of a simple class of DDEs against requirements expressed in a linear-time temporal logic. As requirements specification language, we ex

APA, Harvard, Vancouver, ISO, and other styles

36

Zhang, Hai Bin, and Li Ya Yang. "Model Checking Multirate Hybrid Systems with Dense Timed Interval Temporal Logic." Applied Mechanics and Materials 198-199 (September 2012): 889–93. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.889.

Full text

Abstract:

This paper investigates the model checking issue of multirate hybrid systems. To this end, multirate automata are used to represent the possible behavior of multirate hybrid systems, and a dense timed interval temporal logic (DTITL) is defined to describe the desirable property. To check whether a multirate automaton satisfies a DTITL formula, a corresponding region automaton and a propositional interval temporal logic (PITL) formula are constructed. After each vertex of the region automaton being labeled with propositions appearing in the corresponding PITL formula, the model checking problem

APA, Harvard, Vancouver, ISO, and other styles

37

Demri, Stéphane, and Raul Fervari. "The power of modal separation logics." Journal of Logic and Computation 29, no. 8 (2019): 1139–84. http://dx.doi.org/10.1093/logcom/exz019.

Full text

Abstract:

Abstract We introduce a modal separation logic MSL whose models are memory states from separation logic and the logical connectives include modal operators as well as separating conjunction and implication from separation logic. With such a combination of operators, some fragments of MSL can be seen as genuine modal logics whereas some others capture standard separation logics, leading to an original language to speak about memory states. We analyse the decidability status and the computational complexity of several fragments of MSL, obtaining surprising results by design of proof methods that

APA, Harvard, Vancouver, ISO, and other styles

38

Min Vu, Nguen Tkhi, and G. S. Plesnevich. "Queries on ontologies with temporal dependences on Allen’s extended interval logic." Journal of Computer and Systems Sciences International 55, no. 6 (2016): 912–23. http://dx.doi.org/10.1134/s1064230716060101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bresolin, Davide, Dario Della Monica, Valentin Goranko, Angelo Montanari, and Guido Sciavicco. "The dark side of interval temporal logic: marking the undecidability border." Annals of Mathematics and Artificial Intelligence 71, no. 1-3 (2013): 41–83. http://dx.doi.org/10.1007/s10472-013-9376-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Niu, Luyao, Bhaskar Ramasubramanian, Andrew Clark, and Radha Poovendran. "Robust Satisfaction of Metric Interval Temporal Logic Objectives in Adversarial Environments." Games 14, no. 2 (2023): 30. http://dx.doi.org/10.3390/g14020030.

Full text

Abstract:

This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex time-sensitive tasks in the presence of an adversary. The time-sensitive task is specified as a formula in the metric interval temporal logic (MITL). CPSs that operate in adversarial environments have typically been abstracted as stochastic games (SGs); however, because traditional SG models do not incorporate a notion of time, they cannot be used in a setting where the objective is time-sensitive. To address this, we introduce durational stochastic games (DSGs). DSGs genera

APA, Harvard, Vancouver, ISO, and other styles

41

Kosiuczenko, Piotr. "Temporal Analysis and Classification of Sensor Signals." Sensors 23, no. 6 (2023): 3017. http://dx.doi.org/10.3390/s23063017.

Full text

Abstract:

Understanding the behaviour of sensors, and in particular, the specifications of multisensor systems, are complex problems. The variables that need to be taken into consideration include, inter alia, the application domain, the way sensors are used, and their architectures. Various models, algorithms, and technologies have been designed to achieve this goal. In this paper, a new interval logic, referred to as Duration Calculus for Functions (DC4F), is applied to precisely specify signals originating from sensors, in particular sensors and devices used in heart rhythm monitoring procedures, suc

APA, Harvard, Vancouver, ISO, and other styles

42

Siebra, Clauirton, and Katarzyna Wac. "Engineering uncertain time for its practical integration in ontologies." Knowledge-Based Systems 251, September 2022 (2023): 109152. https://doi.org/10.1016/j.knosys.2022.109152.

Full text

Abstract:

Ontologies are commonly used as a strategy for knowledge representation. However, they are still presenting limitations to model domains that require broad forms of temporal reasoning. This study is part of the Onto-mQoL project and was motivated by the real need to extend static ontologies with diverse time concepts, relations and properties, which go beyond the commonly used Allen's Interval Algebra. Therefore, we use the n-ary relations as the basis for temporal structures, which minimally modify the original ontology, and extend these structures with a generic set of time concepts (moments

APA, Harvard, Vancouver, ISO, and other styles

43

Zhu, Weijun, Changwei Feng, and Huanmei Wu. "Model Checking Temporal Logic Formulas Using Sticker Automata." BioMed Research International 2017 (2017): 1–33. http://dx.doi.org/10.1155/2017/7941845.

Full text

Abstract:

As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed for checking the basic formulas in the above three temporal logic types with DNA molecules. First, one-type single-stranded DNA molecules are employed to encode the Finite State Automaton (FSA) model of th

APA, Harvard, Vancouver, ISO, and other styles

44

Moszkowski, Ben. "A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time." Journal of Applied Non-Classical Logics 14, no. 1-2 (2004): 55–104. http://dx.doi.org/10.3166/jancl.14.55-104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Plesniewicz, Gerald, and Baurzhan Karabekov. "Specifying temporal knowledge for workflows ontologies." Open Computer Science 6, no. 1 (2016): 226–31. http://dx.doi.org/10.1515/comp-2016-0020.

Full text

Abstract:

AbstractA workflow is an automation of a process, in which participants (people or programs) are involved in activities for solving a set of tasks according to certain rules and constraints in order to attain a common goal. The concept of workflow appeared in business informatics. Currently the workflow techniques are used in many other fields such as medical informatics, bioinformatics, automation of scientific research, computer-aided design and manufacturing, etc. An ontology is a formal description (in terms of concepts, entities, their properties and relationships) of knowledge for solvin

APA, Harvard, Vancouver, ISO, and other styles

46

HIRSCH, ROBIN, and MARK REYNOLDS. "THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE." Journal of Symbolic Logic 83, no. 3 (2018): 829–67. http://dx.doi.org/10.1017/jsl.2017.79.

Full text

Abstract:

AbstractWe consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, x can access y if an electromagnetic or (slower than light) mechanical signal could be sent from x to y. We use Prior’s tense language of F and P representing causal accessibility and its converse relation. We consider two versions, one where the accessibility relation is reflexive and one where it is irreflexive. In either case it has been an open problem, for decades, whether the logic is decidable or axiomatisable. We make a small step forward by proving, in

APA, Harvard, Vancouver, ISO, and other styles

47

Yoshioka, Suguru, and Satoshi Tojo. "Many-dimensional Modal Logic of Tense and Temporal Interval and its Decidability." Transactions of the Japanese Society for Artificial Intelligence 21 (2006): 257–65. http://dx.doi.org/10.1527/tjsai.21.257.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Montanari, Angelo, Marco Pazzaglia, and Pietro Sala. "Adding one or more equivalence relations to the interval temporal logic ABB¯." Theoretical Computer Science 629 (May 2016): 116–34. http://dx.doi.org/10.1016/j.tcs.2015.11.030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Xu, Qing-guo, and Huai-kou Miao. "Timed automata for metric interval temporal logic formulae in prototype verification system." Journal of Shanghai University (English Edition) 12, no. 4 (2008): 339–46. http://dx.doi.org/10.1007/s11741-008-0411-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Guelev, D. P. "A Complete Proof System for First-order Interval Temporal Logic with Projection." Journal of Logic and Computation 14, no. 2 (2004): 215–49. http://dx.doi.org/10.1093/logcom/14.2.215.

Full text

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!