Log in

Relevant bibliographies by topics / Temporal Logic Reasoning / Journal articles

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

Journal articles on the topic 'Temporal Logic Reasoning'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 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 'Temporal Logic Reasoning.'

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

Long, Derek. "A review of temporal logics." Knowledge Engineering Review 4, no. 2 (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, Kowalsk

APA, Harvard, Vancouver, ISO, and other styles

2

Xiong, Liping, та Sumei Guo. "Representation and Reasoning about Strategic Abilities with ω-Regular Properties". Mathematics 9, № 23 (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 proble

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

von KARGER, BURGHARD. "Temporal algebra." Mathematical Structures in Computer Science 8, no. 3 (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 intuitionis

APA, Harvard, Vancouver, ISO, and other styles

5

Cai, Bibo, Xiao Ding, Zhouhao Sun, et al. "Self-Supervised Logic Induction for Explainable Fuzzy Temporal Commonsense Reasoning." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 11 (2023): 12580–88. http://dx.doi.org/10.1609/aaai.v37i11.26481.

Full text

Abstract:

Understanding temporal commonsense concepts, such as times of occurrence and durations is crucial for event-centric language understanding. Reasoning about such temporal concepts in a complex context requires reasoning over both the stated context and the world knowledge that underlines it. A recent study shows massive pre-trained LM still struggle with such temporal reasoning under complex contexts (e.g., dialog) because they only implicitly encode the relevant contexts and fail to explicitly uncover the underlying logical compositions for complex inference, thus may not be robust enough. In

APA, Harvard, Vancouver, ISO, and other styles

6

DEMRI, STÉPHANE, and DAVID NOWAK. "REASONING ABOUT TRANSFINITE SEQUENCES." International Journal of Foundations of Computer Science 18, no. 01 (2007): 87–112. http://dx.doi.org/10.1142/s0129054107004589.

Full text

Abstract:

We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals replace the standard next-time and until future-time operators. Our aim is to control such systems by designing controllers that safely work on ω-sequences but interact synchronously with the system in order to restrict their behaviors. We show that the satisfiability and model-checking for the logics working on ωk-sequences is EXPSPACE-complete wh

APA, Harvard, Vancouver, ISO, and other styles

7

Sistla, A. P., and L. D. Zuck. "Reasoning in a Restricted Temporal Logic." Information and Computation 102, no. 2 (1993): 167–95. http://dx.doi.org/10.1006/inco.1993.1006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kamide, Norihiro, and Daiki Koizumi. "Method for Combining Paraconsistency and Probability in Temporal Reasoning." Journal of Advanced Computational Intelligence and Intelligent Informatics 20, no. 5 (2016): 813–27. http://dx.doi.org/10.20965/jaciii.2016.p0813.

Full text

Abstract:

Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, thereby indicating that we can reuse existing pCTL-based mo

APA, Harvard, Vancouver, ISO, and other styles

9

GIORDANO, LAURA, ALBERTO MARTELLI, and DANIELE THESEIDER DUPRÉ. "Reasoning about actions with Temporal Answer Sets." Theory and Practice of Logic Programming 13, no. 2 (2012): 201–25. http://dx.doi.org/10.1017/s1471068411000639.

Full text

Abstract:

AbstractIn this paper, we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the us

APA, Harvard, Vancouver, ISO, and other styles

10

BALTAZAR, P., R. CHADHA, and P. MATEUS. "QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS." International Journal of Quantum Information 06, no. 02 (2008): 219–36. http://dx.doi.org/10.1142/s0219749908003530.

Full text

Abstract:

Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper, we consider quantum computation tree logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL model-checking algorithm with the dEQPL model-checking algorithm to obtain a model-checking algorithm for QCTL. Finally, we illustrate the use of the logic by reasoning about the BB84 key distribution protocol.

APA, Harvard, Vancouver, ISO, and other styles

11

Baheri, Ali, and Peng Wei. "Multi-Fidelity Temporal Reasoning: A Stratified Logic for Cross-Scale System Specifications." Logics 3, no. 2 (2025): 5. https://doi.org/10.3390/logics3020005.

Full text

Abstract:

We present Stratified Metric Temporal Logic (SMTL), a novel formalism for specifying and verifying the properties of complex cyber–physical systems that exhibit behaviors across multiple temporal and abstraction scales. SMTL extends existing temporal logics by incorporating a stratification operator, enabling the association of temporal properties with specific abstraction levels. This allows for the natural expression of multi-scale requirements while maintaining formal reasoning about inter-level relationships. We formalize the syntax and semantics of SMTL, proving that it strictly subsumes

APA, Harvard, Vancouver, ISO, and other styles

12

Meyer, Roland, Thomas Wies, and Sebastian Wolff. "Embedding Hindsight Reasoning in Separation Logic." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1848–71. http://dx.doi.org/10.1145/3591296.

Full text

Abstract:

Automatically proving linearizability of concurrent data structures remains a key challenge for verification. We present temporal interpolation as a new proof principle to guide automated proof search using hindsight arguments within concurrent separation logic. Temporal interpolation offers an easy-to-automate alternative to prophecy variables and has the advantage of structuring proofs into easy-to-discharge hypotheses. Additionally, we advance hindsight theory by integrating it into a program logic, bringing formal rigor and complementary proof machinery. We substantiate the usefulness of t

APA, Harvard, Vancouver, ISO, and other styles

13

Garcez, Artur S. d'Avila, and Luís C. Lamb. "A Connectionist Computational Model for Epistemic and Temporal Reasoning." Neural Computation 18, no. 7 (2006): 1711–38. http://dx.doi.org/10.1162/neco.2006.18.7.1711.

Full text

Abstract:

The importance of the efforts to bridge the gap between the connectionist and symbolic paradigms of artificial intelligence has been widely recognized. The merging of theory (background knowledge) and data learning (learning from examples) into neural-symbolic systems has indicated that such a learning system is more effective than purely symbolic or purely connectionist systems. Until recently, however, neural-symbolic systems were not able to fully represent, reason, and learn expressive languages other than classical propositional and fragments of first-order logic. In this article, we show

APA, Harvard, Vancouver, ISO, and other styles

14

Leasure, David E. "TEMPORAL REASONING WITH THE MODAL LOGIC Z." Computational Intelligence 12, no. 3 (1996): 407–22. http://dx.doi.org/10.1111/j.1467-8640.1996.tb00269.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Tiger, Mattias, and Fredrik Heintz. "Incremental reasoning in probabilistic Signal Temporal Logic." International Journal of Approximate Reasoning 119 (April 2020): 325–52. http://dx.doi.org/10.1016/j.ijar.2020.01.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

ENGELFRIET, JOERI, and JAN TREUR. "Executable Temporal Logic for Non-monotonic Reasoning." Journal of Symbolic Computation 22, no. 5-6 (1996): 615–25. http://dx.doi.org/10.1006/jsco.1996.0068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mu, Chunyan, Nima Motamed, Natasha Alechina, and Brian Logan. "Probabilistic Strategy Logic with Degrees of Observability." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 14 (2025): 15092–99. https://doi.org/10.1609/aaai.v39i14.33655.

Full text

Abstract:

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information transparency. Information transparency concerns the extent to which agents' behaviours and actions are observable by other agents. Reasoning about information transparency is useful in many domains including security, privacy, and decision-making. In this paper, we present a formal framework for reasoning about information transparency properties in stochastic multi

APA, Harvard, Vancouver, ISO, and other styles

18

Wolter, Frank, and Michael Zakharyaschev. "A logic for metric and topology." Journal of Symbolic Logic 70, no. 3 (2005): 795–828. http://dx.doi.org/10.2178/jsl/1122038915.

Full text

Abstract:

AbstractWe propose a logic for reasoning about metric spaces with the induced topologies. It combines the ‘qualitative’ interior and closure operators with ‘quantitative’ operators ‘somewhere in the sphere of radius r’ including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard ‘ε-definitions’ of closure and interior to simple constraints on relations. These features of the relati

APA, Harvard, Vancouver, ISO, and other styles

19

Ramakrishna, Y. S., L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, and G. Kutty. "An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until1." Fundamenta Informaticae 17, no. 3 (1992): 271–82. http://dx.doi.org/10.3233/fi-1992-17307.

Full text

Abstract:

We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and refinement and make reasoning about concurrency difficult. A proof of the soundness and completeness of the decision procedure is given, and its complexity is analyzed.

APA, Harvard, Vancouver, ISO, and other styles

20

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

21

Moszkowski. "A Temporal Logic for Multilevel Reasoning about Hardware." Computer 18, no. 2 (1985): 10–19. http://dx.doi.org/10.1109/mc.1985.1662795.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Lin, Jing-Yue, and D. Ionescu. "Reasoning of Discrete Event Systems in Temporal Logic." IFAC Proceedings Volumes 24, no. 5 (1991): 47–52. http://dx.doi.org/10.1016/s1474-6670(17)51222-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Mogavero, Fabio, Aniello Murano, and Moshe Y. Vardi. "Relentful strategic reasoning in alternating-time temporal logic." Journal of Logic and Computation 26, no. 5 (2014): 1663–95. http://dx.doi.org/10.1093/logcom/exu052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Lorini, Emiliano. "Temporal logic and its application to normative reasoning." Journal of Applied Non-Classical Logics 23, no. 4 (2013): 372–99. http://dx.doi.org/10.1080/11663081.2013.841359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kiyatkin, Vladimir R. "Satisfiability in a Temporal Multi-valueted Logic Based on Z." Journal of Siberian Federal University. Mathematics & Physics 15, no. 1 (2022): 56–74. http://dx.doi.org/10.17516/1997-1397-2022-15-1-56-74.

Full text

Abstract:

In this paper we continue the series of papers by V. V. Rybakov devoted to properties of multi-valueted logics and where he propose a new approach for modelling knowledge and reasoning of agents in a multi-agent system. We prove that the satisfiability problem is decidable in a temporal multi-valueted logic based on Z

APA, Harvard, Vancouver, ISO, and other styles

26

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 (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 th

APA, Harvard, Vancouver, ISO, and other styles

27

BALABAN, MIRA, and DAN BRAHA. "Temporal reasoning in process planning." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 13, no. 2 (1999): 91–104. http://dx.doi.org/10.1017/s0890060499132049.

Full text

Abstract:

Computer-aided process planning has been recognized as an important tool for coordinating the different operations involved in making the product. While temporal knowledge is central to the design of efficient and reliable process plans, little attention is given to the integration of process planning and temporal processing and reasoning. To fill the void, we propose in this paper a practical approach, which is inspired by the framework of Temporal Constraint Satisfaction Problem (TCSP), to integrate process planning and temporal reasoning. We show that a TCSP formulation is a subset of a for

APA, Harvard, Vancouver, ISO, and other styles

28

De Leng, Daniel, and Fredrik Heintz. "Approximate Stream Reasoning with Metric Temporal Logic under Uncertainty." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2760–67. http://dx.doi.org/10.1609/aaai.v33i01.33012760.

Full text

Abstract:

Stream reasoning can be defined as incremental reasoning over incrementally-available information. The formula progression procedure for Metric Temporal Logic (MTL) makes use of syntactic formula rewritings to incrementally evaluate formulas against incrementally-available states. Progression however assumes complete state information, which can be problematic when not all state information is available or can be observed, such as in qualitative spatial reasoning tasks or in robotics applications. In those cases, there may be uncertainty as to which state out of a set of possible states repres

APA, Harvard, Vancouver, ISO, and other styles

29

Hudli, Anand V., and Raghu V. Hudli. "Temporal Logic Based Hierarchical Test Generation for Sequential VLSI Circuits." VLSI Design 2, no. 1 (1994): 69–80. http://dx.doi.org/10.1155/1994/94514.

Full text

Abstract:

Test generation for sequential VLSI circuits has remained a difficult problem to solve. The difficulty arises because of reasoning about temporal behavior of sequential circuits. We use temporal logic to model digital circuits. Temporal Logic can model circuits hierarchically. A set of heuristics is given to aid during test generation. A hierarchical test generation algorithm is proposed.

APA, Harvard, Vancouver, ISO, and other styles

30

Wang, Ruolin, Yuejiao Xu, and Jianmin Ji. "Traffic Scenario Logic: A Spatial-Temporal Logic for Modeling and Reasoning of Urban Traffic Scenarios." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 14 (2025): 15195–202. https://doi.org/10.1609/aaai.v39i14.33667.

Full text

Abstract:

Formal representations of traffic scenarios can be used to generate test cases for the safety verification of autonomous driving. However, most existing methods are limited to highway or highly simplified intersection scenarios due to the intricacy and diversity of traffic scenarios. In response, we propose Traffic Scenario Logic (TSL), which is a spatial-temporal logic designed for modeling and reasoning of urban pedestrian-free traffic scenarios. TSL provides a formal representation of the urban road network that can be derived from OpenDRIVE, i.e., the de facto industry standard of high-def

APA, Harvard, Vancouver, ISO, and other styles

31

Reynolds, Mark. "Metric temporal reasoning with less than two clocks." Journal of Applied Non-Classical Logics 20, no. 4 (2010): 437–55. http://dx.doi.org/10.3166/jancl.20.437-455.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Giordano, L. "Reasoning about actions in dynamic linear time temporal logic." Logic Journal of IGPL 9, no. 2 (2001): 273–88. http://dx.doi.org/10.1093/jigpal/9.2.273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Gladyshev, Maksim, Natasha Alechina, Mehdi Dastani, Dragan Doder, and Brian Logan. "Temporal Causal Reasoning with (Non-Recursive) Structural Equation Models." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 14 (2025): 14949–57. https://doi.org/10.1609/aaai.v39i14.33639.

Full text

Abstract:

Structural equation models (SEM) are a standard approach to representing causal dependencies between variables. In this paper we propose a new interpretation of existing formalisms in the field of Actual Causality in which SEM's are viewed as mechanisms transforming the dynamics of exogenous variables into the dynamics of endogenous variables. This allows us to combine counterfactual causal reasoning with existing temporal logic formalizms, and to introduce a temporal logic, CPLTL, for causal reasoning about such structures. Then, we demonstrate that the standard restriction to so-called recur

APA, Harvard, Vancouver, ISO, and other styles

34

Belardinelli, F., and A. Lomuscio. "Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results." Journal of Artificial Intelligence Research 45 (September 10, 2012): 1–45. http://dx.doi.org/10.1613/jair.3547.

Full text

Abstract:

We investigate a class of first-order temporal-epistemic logics for reasoning about multi-agent systems. We encode typical properties of systems including perfect recall, synchronicity, no learning, and having a unique initial state in terms of variants of quantified interpreted systems, a first-order extension of interpreted systems. We identify several monodic fragments of first-order temporal-epistemic logic and show their completeness with respect to their corresponding classes of quantified interpreted systems.

APA, Harvard, Vancouver, ISO, and other styles

35

Eger, Markus, Camille Barot, and R. Young. "Merits of a Temporal Modal Logic for Narrative Discourse Generation." Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 11, no. 4 (2021): 23–29. http://dx.doi.org/10.1609/aiide.v11i4.12836.

Full text

Abstract:

Just as there exists varied uses for computational models of narrative, there exists a wide variety of languages aimed at representing stories. A number of them have historic roots in automated generation, for which these languages have to be limited in order to make the generation process computationally feasible. Other are focused on story understanding, with close ties to natural language making many reasoning processes computationally intractable. In this paper, we discuss the trade-off between expressivity and computational complexity of the reasoning process and argue that Impulse, a tem

APA, Harvard, Vancouver, ISO, and other styles

36

Martiny, Karsten, and Ralf Möller. "PDT Logic: A Probabilistic Doxastic Temporal Logic for Reasoning about Beliefs in Multi-agent Systems." Journal of Artificial Intelligence Research 57 (September 21, 2016): 39–112. http://dx.doi.org/10.1613/jair.5182.

Full text

Abstract:

We present Probabilistic Doxastic Temporal (PDT) Logic, a formalism to represent and reason about probabilistic beliefs and their temporal evolution in multi-agent systems. This formalism enables the quantification of agents beliefs through probability intervals and incorporates an explicit notion of time. We discuss how over time agents dynamically change their beliefs in facts, temporal rules, and other agents beliefs with respect to any new information they receive. We introduce an appropriate formal semantics for PDT Logic and show that it is decidable. Alternative options of specifying

APA, Harvard, Vancouver, ISO, and other styles

37

De Giacomo, Giuseppe, and Marco Favorito. "Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata." Proceedings of the International Conference on Automated Planning and Scheduling 31 (May 17, 2021): 122–30. http://dx.doi.org/10.1609/icaps.v31i1.15954.

Full text

Abstract:

The translation from temporal logics to automata is the workhorse algorithm of several techniques in computer science and AI, such as reactive synthesis, reasoning about actions, FOND planning with temporal specifications, and reinforcement learning with non-Markovian rewards, to name a few. Unfortunately, the problem is computationally intractable, requiring the implementation of several heuristics to make it usable in practice. In this paper, following the recent interest in temporal logic formalisms over finite traces, we present a compositional approach for dealing with translations of Lin

APA, Harvard, Vancouver, ISO, and other styles

38

Doder, Dragan, Zoran Ognjanović, and Zoran Marković. "An Axiomatization of a First-order Branching Time Temporal Logic." JUCS - Journal of Universal Computer Science 16, no. (11) (2010): 1439–51. https://doi.org/10.3217/jucs-016-11-1439.

Full text

Abstract:

We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic.

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

Zeng, Yajian, Xiaorong Hou, Xinrui Wang, and Junying Li. "Towards a Unified Temporal and Event Logic Paradigm for Multi-Hop Path Reasoning in Knowledge Graphs." Electronics 14, no. 3 (2025): 516. https://doi.org/10.3390/electronics14030516.

Full text

Abstract:

Path reasoning in knowledge graphs is a pivotal task for uncovering complex relational patterns and facilitating advanced inference processes. It also holds significant potential in domains such as power electronics, where real-time reasoning over dynamic, evolving data is essential for advancing topology design and application systems. Despite its importance, traditional approaches often encounter substantial limitations when applied to dynamic, time-sensitive scenarios. These models typically fail to adequately capture intricate logical dependencies and demonstrate suboptimal performance in

APA, Harvard, Vancouver, ISO, and other styles

41

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

42

Chittaro, Luca, and Angelo Montanari. "Trends in temporal representation and reasoning." Knowledge Engineering Review 11, no. 3 (1996): 281–88. http://dx.doi.org/10.1017/s026988890000792x.

Full text

Abstract:

Time is one of the most relevant topics in AI. It plays a major role in several of AI research areas, ranging from logical foundations to applications of knowledge-based systems. Despite the ubiquity of time in AI, researchers tend to specialise and focus on time in particular contexts or applications, overlooking meaningful connections between different areas. In an attempt to promote crossfertilisation and reduce isolation, the Temporal Representation and Reasoning (TIME) workshop series was started in 1994. The third edition of the workshop was held on May 19–20 1996 in Key West, FL, with S

APA, Harvard, Vancouver, ISO, and other styles

43

Fisher, Michael, and Michael Wooldridge. "On the Formal Specification and Verification of Multi-Agent Systems." International Journal of Cooperative Information Systems 06, no. 01 (1997): 37–65. http://dx.doi.org/10.1142/s0218843097000057.

Full text

Abstract:

This article describes first steps towards the formal specification and verification of multi-agent systems, through the use of temporal belief logics. The article first describes Concurrent METATEM, a multi-agent programming language, and then develops a logic that may be used to reason about Concurrent METATEM systems. The utility of this logic for specifying and verifying Concurrent METATEM systems is demonstrated through a number of examples. The article concludes with a brief discussion on the wider implications of the work, and in particular on the use of similar logics for reasoning abo

APA, Harvard, Vancouver, ISO, and other styles

44

van Weert, B. F. J., and A. Crespo. "A Real-Time Expert System Shell with Progressive Reasoning, Temporal Reasoning and Fuzzy Logic." IFAC Proceedings Volumes 29, no. 1 (1996): 7207–12. http://dx.doi.org/10.1016/s1474-6670(17)58844-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

MACNISH, C. K. "NONMONOTONIC TEMPORAL REASONING: A LOGIC-BASED APPROACH TO DECLARATIVE MODELING." Cybernetics and Systems 29, no. 5 (1998): 425–59. http://dx.doi.org/10.1080/019697298125579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Liu, Wei, Wenjie Xu, Dong Wang, Zongtian Liu, and Xujie Zhang. "A Temporal Description Logic for Reasoning about Action in Event." Information Technology Journal 11, no. 9 (2012): 1211–18. http://dx.doi.org/10.3923/itj.2012.1211.1218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Orgun, Mehmet A., Chuchang Liu, and Abhaya C. Nayak. "Knowledge Representation, Reasoning and Integration Using Temporal Logic with Clocks." Mathematics in Computer Science 2, no. 1 (2008): 143–63. http://dx.doi.org/10.1007/s11786-008-0048-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

An, Ziyan, Taylor T. Johnson, and Meiyi Ma. "Formal Logic Enabled Personalized Federated Learning through Property Inference." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 10 (2024): 10882–90. http://dx.doi.org/10.1609/aaai.v38i10.28962.

Full text

Abstract:

Recent advancements in federated learning (FL) have greatly facilitated the development of decentralized collaborative applications, particularly in the domain of Artificial Intelligence of Things (AIoT). However, a critical aspect missing from the current research landscape is the ability to enable data-driven client models with symbolic reasoning capabilities. Specifically, the inherent heterogeneity of participating client devices poses a significant challenge, as each client exhibits unique logic reasoning properties. Failing to consider these device-specific specifications can result in c

APA, Harvard, Vancouver, ISO, and other styles

49

Cai, Bibo, Xiao Ding, Bowen Chen, Li Du, and Ting Liu. "Mitigating Reporting Bias in Semi-supervised Temporal Commonsense Inference with Probabilistic Soft Logic." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 10 (2022): 10454–62. http://dx.doi.org/10.1609/aaai.v36i10.21288.

Full text

Abstract:

Acquiring high-quality temporal common sense (TCS) knowledge from free-form text is a crucial but challenging problem for event-centric natural language understanding, due to the language reporting bias problem: people rarely report the commonly observed events but highlight the special cases. For example, one may rarely report "I get up from bed in 1 minute", but we can observe "It takes me an hour to get up from bed every morning'' in text. Models directly trained upon such corpus would capture distorted TCS knowledge, which could influence the model performance. Prior work addresses this is

APA, Harvard, Vancouver, ISO, and other styles

50

Tena Cucala, David J., Przemysław A. Wałęga, Bernardo Cuenca Grau, and Egor Kostylev. "Stratified Negation in Datalog with Metric Temporal Operators." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (2021): 6488–95. http://dx.doi.org/10.1609/aaai.v35i7.16804.

Full text

Abstract:

We extend DatalogMTL—Datalog with operators from metric temporal logic—by adding stratified negation as failure. The new language provides additional expressive power for representing and reasoning about temporal data and knowledge in a wide range of applications. We consider models over the rational timeline, study their properties, and establish the computational complexity of reasoning. We show that, as in negation-free DatalogMTL, fact entailment in our language is PSPACE-complete in data and EXPSPACE-complete in combined complexity. Thus, the extension with stratified negation does not le

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!