Log in

Relevant bibliographies by topics / Temporal Logic Reasoning

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Temporal Logic Reasoning"

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

More sources

Dissertations / Theses on the topic "Temporal Logic Reasoning"

1

Evans, David Hugh. "An investigation of persistence in temporal reasoning." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267814.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nogueira, Vitor Beires. "Temporal reasoning in a logic programming language with modularity." Doctoral thesis, Universidade de Évora, 2008. http://hdl.handle.net/10174/11138.

Full text

Abstract:

Actualmente os Sistemas de Informação Organizacionais (SIO) lidam cada vez mais com informação que tem dependências temporais. Neste trabalho concebemos um ambiente de trabalho para construir e manter SIO Temporais. Este ambiente assenta sobre um linguagem lógica denominada Temporal Contextua) Logic Programming que integra modularidade com raciocínio temporal fazendo com que a utilização de um módulo dependa do tempo do contexto. Esta linguagem é a evolução de uma outra, também introduzida nesta tese, que combina Contextua) Logic Programming com Temporal Annotated Constraint Logic Programming,

APA, Harvard, Vancouver, ISO, and other styles

3

Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.

Full text

Abstract:

This thesis is about automated reasoning in quantified modal and temporal logics, with an application to formal methods. Quantified modal and temporal logics are extensions of classical first-order logic in which the notion of truth is extended to take into account its necessity or equivalently, in the temporal setting, its persistence through time. Due to their high complexity, these logics are less widely known and studied than their propositional counterparts. Moreover, little so far is known about their mechanisability and usefulness for formal methods. The relevant contributions of this t

APA, Harvard, Vancouver, ISO, and other styles

4

Legge, Gaynor W. "A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278352/.

Full text

Abstract:

This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event simulators. As background, current methods of integrating artificial intelligence with simulation and relevant research are briefly reviewed.

APA, Harvard, Vancouver, ISO, and other styles

5

BERTAGNON, ALESSANDRO. "Improving Reasoning in Constraint Logic Programming: an Application to Route Planning and Qualitative Temporal Reasoning Problems." Doctoral thesis, Università degli studi di Ferrara, 2022. http://hdl.handle.net/11392/2487898.

Full text

Abstract:

Constraint (Logic) Programming (CLP) is a popular paradigm to deal with Constraint Satisfaction Problems (CSPs) and Constraint Optimization Problems (COPs) in artificial intelligence. Constraint solving techniques, also known as constraint reasoning algorithms, can be divided into two distinct and orthogonal strategies: inference (or constraint propagation) and search. In this research we address constraint reasoning algorithms for two popular application domains: vehicle route planning and qualitative temporal reasoning. Regarding vehicle route planning, we study the Euclidean TSP (ETSP), a s

APA, Harvard, Vancouver, ISO, and other styles

6

Rusmawati, Yanti. "Modelling and reasoning about dynamic networks as concurrent systems." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/modelling-and-reasoning-about-dynamic-networks-as-concurrent-systems(f6bd4a9c-e356-48ea-83a4-3d9d17c550c2).html.

Full text

Abstract:

Highly dynamic and complex computing systems are increasingly needed and are relied upon in daily life. One such system is the dynamic network, particularly in communication, in which it has widespread applications, such as: Internet, peer-to-peer networks, mobile networks and wireless networks. Dynamic networks consist of nodes and edges whose operating status may change over time; the edges may be unreliable and operate intermittently. Message-passing in such networks is inherently difficult and reasoning about the behaviour of message-passing algorithms is also difficult and hard to analyse

APA, Harvard, Vancouver, ISO, and other styles

7

Martiny, Karsten [Verfasser]. "PDT logic : a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems / Karsten Martiny." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1152030132/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hallin, Magnus. "SMT-Based Reasoning and Planning in TAL." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72596.

Full text

Abstract:

Automated planning as a satisfiability problem is a method developed in theearly nineties. It has some known disadvantages, such as its inefficient encod-ing of numbers. The field of Satisfiability Modulo Teories tries to connectalready established solvers for e.g. linear constraints into SAT-solvers in orderto make reasoning about numerical values more efficient. This thesis combines planning as satisfiability and SMT to perform efficientreasoning about actions that occupy realistic time in Temporal Action Logic,a formalism developed at Linköping University for reasoning about action andchang

APA, Harvard, Vancouver, ISO, and other styles

9

Leeser, Miriam Ellen. "Reasoning about the function and timing of integrated circuits with Prolog and temporal logic." Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.232797.

Full text

Abstract:

The structure of circuits is specified with Prolog; their function and timing behaviour is specified with interval temporal logic. These structural and behavioural specifications are used to formally verify the functionality of circuit elements as well as their timing characteristics. A circuit is verified by deriving its behaviour from the behaviour of its components. The derived results can be abstracted to functional descriptions with timing constraints. The functional descriptions can then be used in proofs of more complex hardware circuits. Verification is done hierarchically, with transi

APA, Harvard, Vancouver, ISO, and other styles

10

Lu, Zhirui. "Multi-valued temporal logic based reasoning system with applications to decision support in intelligent environments." Thesis, University of Ulster, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.550789.

Full text

Abstract:

This work deals with decision-making problems with uncertain information in dynamic environment. It develops a new logic system, multi-valued temporal propositional logic, combining multi-valued logic and linear temporal logic. This new logic allows uncertain information to be represented with either a numerical truth value in the [0,1] interval or a linguistic value, and uses these values with both states and same-time and next-time rules. Multi-valued temporal propositional logic, a generic logic system, provides a simple calculus for analysing uncertain information with Lukasiewicz implicat

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Temporal Logic Reasoning"

1

Ligozat, Gérard. Qualitative spatial and temporal reasoning. ISTE, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sion, Avi. Future Logic: Categorical and conditional deduction and induction of the natural, temporal, extensional, and logical modalities. Author, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Leeser, M. E. Reasoning about the function and timing of integrated circuits with prolog and temporal logic. University of Cambridge, Computer Laboratory, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Leeser, M. E. Reasoning about the functioning and timing of integrated circuits with prolog and temporal logic. University of Cambridge, Computer Laboratory, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hazarika, Shyamanta M. Qualitative spatio-temporal representation and reasoning: Trends and future directions. Information Science Reference, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mark, Reynolds, Sattar Abdul 1957-, Murdoch University, Griffith University, University of Western Australia, and International Conference on Temporal Logic (4th : 2003 : Cairns, Qld.), eds. TIME-ICTL 2003 : 10th International Symposium on Temporal Representation and Reasoning: And Fourth International Conference on Temporal Logic : proceedings : 8-10 July, 2003, Cairns, Queensland, Australia. IEEE Computer Society Press, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ligozat, G. Qualitative Spatial and Temporal Reasoning. Wiley & Sons, Incorporated, John, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ligozat, Gérard. Qualitative Spatial and Temporal Reasoning. Wiley & Sons, Incorporated, John, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ligozat, Gérard. Qualitative Spatial and Temporal Reasoning. Wiley & Sons, Incorporated, John, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ligozat, Gérard. Qualitative Spatial and Temporal Reasoning. Wiley & Sons, Incorporated, John, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Temporal Logic Reasoning"

1

Bozzelli, Laura, and César Sánchez. "Visibly Linear Temporal Logic." In Automated Reasoning. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08587-6_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Allen, James F., and George Ferguson. "Actions and Events in Interval Temporal Logic." In Spatial and Temporal Reasoning. Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-0-585-28322-7_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hirsch Hadorn, Gertrude. "Temporal Strategies for Decision-making." In Logic, Argumentation & Reasoning. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30549-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Desclés, Jean-Pierre. "Reasoning and Aspectual-Temporal Calculus." In Logic, Thought and Action. Springer Netherlands, 2005. http://dx.doi.org/10.1007/1-4020-3167-x_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gonçalves, Ricardo, Matthias Knorr, João Leite, and Martin Slota. "Non-monotonic Temporal Goals." In Logic Programming and Nonmonotonic Reasoning. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40564-8_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Duan, Zhenhua, Maciej Koutny, and Chris Holt. "Projection in temporal logic programming." In Logic Programming and Automated Reasoning. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58216-9_48.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lutz, Carsten, Holger Sturm, Frank Wolter, and Michael Zakharyaschev. "Tableaux for Temporal Description Logic with Constant Domains." In Automated Reasoning. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45744-5_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Héam, Pierre-Cyrille, Vincent Hugot, and Olga Kouchnarenko. "From Linear Temporal Logic Properties to Rewrite Propositions." In Automated Reasoning. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31365-3_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cabalar, Pedro. "Stable Models for Temporal Theories." In Logic Programming and Nonmonotonic Reasoning. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23264-5_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Faella, Marco, Margherita Napoli, and Mimmo Parente. "Graded Alternating-Time Temporal Logic." In Logic for Programming, Artificial Intelligence, and Reasoning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17511-4_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Temporal Logic Reasoning"

1

Cabalar, Pedro, Thomas Eiter, and Davide Soldà. "Contracted Temporal Equilibrium Logic." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/21.

Full text

Abstract:

The stable model semantics of logic programs has been characterized by Equilibrium Logic, which is a non-monotonic formalism that selects models from the (monotonic) intermediate logic of Here-and-There. It provides stable models for arbitrary propositional formulas and has been fruitfully extended to different modal languages. Among them are theories in the syntax of Linear-Time Temporal Logic (LTL), giving rise to Temporal Equilibrium logic (TEL) based on Temporal Here-and-There (THT). In TEL, models are selected that minimize truth among THT traces of the same length. In this paper, we cons

APA, Harvard, Vancouver, ISO, and other styles

2

Artale, Alessandro, Roman Kontchakov, Andrea Mazzullo, and Frank Wolter. "Non-Rigid Designators in Modal and Temporal Free Description Logics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/8.

Full text

Abstract:

Definite descriptions, such as ‘the General Chair of KR 2024’, are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for their non-rigidity, which allows them to designate different objects (or none at all) at different states. We propose expressive modal description logics with non-rigid definite descriptions and names, and investigate decidability and complexity of the satisfiability problem. We first systematically link satisfiability for the one-variable fragment of first-

APA, Harvard, Vancouver, ISO, and other styles

3

Fernández-Duque, David, Brett McLean, and Lukas Zenger. "A Sound and Complete Axiomatisation for Intuitionistic Linear Temporal Logic." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/33.

Full text

Abstract:

Intuitionistic linear temporal logic (iLTL) has been studied extensively, especially in the last decade. It enjoys natural semantics over intuitionistic Kripke frames equipped with an order-preserving function representing the temporal dynamics, known as 'expanding models'. This leads to a logic that is known to be decidable but whose axiomatisation has long remained open. We propose an extension of iLTL with the co-implication connective of Hilbert–Brouwer logic and call it 'bi-intuitionistic linear temporal logic' (biLTL). We establish that this extension is still decidable for the class of

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Tingxuan, Liu Yang, Zidong Wang, Shuai Luo, and Jun Long. "Enhancing Extrapolation Reasoning on Temporal Knowledge Graphs with Logic Rules and Queries." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10889675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Aminof, Benjamin, Giuseppe De Giacomo, Sasha Rubin, and Florian Zuleger. "Proper Linear-time Specifications of Environment Behaviors in Nondeterministic Planning and Reactive Synthesis." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/4.

Full text

Abstract:

To help it achieve its goal, an agent exploits assumptions it has about the behavior of its environment. The common view in planning and reactive synthesis is that such assumptions are sets of traces. This trace-centric view has the advantage of having well-understood specification formalisms, such as linear-time temporal logic. An alternative view, that we have promoted as being conceptually superior, is strategy-centric: assumptions are non-empty sets of environment strategies. In this work we relate these views and show that the strategy-centric view is a refinement of the trace-centric vie

APA, Harvard, Vancouver, ISO, and other styles

6

Hyland, David, Munyque Mittelmann, Aniello Murano, Giuseppe Perelli, and Michael Wooldridge. "Incentive Design for Rational Agents." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/44.

Full text

Abstract:

We introduce Incentive Design: a new class of problems for equilibrium verification in multi-agent systems. In our model, agents attempt to maximize their utility functions, which are expressed as formulae in LTL[F], a quantitative extension of Linear Temporal Logic with functions computable in polynomial time. We assume agents are rational, in the sense that they adopt strategies consistent with game theoretic solution concepts such as Nash equilibrium. For each solution concept we consider, we analyze the problems of verifying whether an incentive scheme achieves a societal objective and fin

APA, Harvard, Vancouver, ISO, and other styles

7

Aminof, Benjamin, Linus Cooper, Sasha Rubin, Moshe Y. Vardi, and Florian Zuleger. "Probabilistic Synthesis and Verification for LTL on Finite Traces." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/3.

Full text

Abstract:

We study synthesis and verification of probabilistic models and specifications over finite traces. Probabilistic models are formalized in this work as Markov Chains and Markov Decisions Processes. Motivated by the recent attention given to, and importance of, finite-trace specifications in AI, we use linear-temporal logic on finite traces as a specification formalism for properties of traces with finite but unbounded time horizons. Since there is no bound on the time horizon, our Markov chains generate infinite traces, and we consider two possible semantics: “existential (resp. universal) pref

APA, Harvard, Vancouver, ISO, and other styles

8

Morales, A., and G. Sciavicco. "Using Temporal Logic for Spatial Reasoning: Spatial Propositional Neighborhood Logic." In Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06). IEEE, 2006. http://dx.doi.org/10.1109/time.2006.34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gigante, Nicola, Lucía Gómez Álvarez, and Tim S. Lyon. "Standpoint Linear Temporal Logic." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/31.

Full text

Abstract:

Many complex scenarios require the coordination of agents holding different points of view, possibly cooperating and not necessarily agreeing. For this reason, standpoint logic (SL) has been recently introduced in the context of knowledge integration, allowing one to reason with diverse and potentially conflicting viewpoints held by different agents. Linear temporal logic (LTL) is the most widely known formalism to express temporal properties of systems and processes, both in formal methods and artificial intelligence related fields. In this paper, we present 'standpoint linear temporal logic'

APA, Harvard, Vancouver, ISO, and other styles

10

Yang, Yuan, Siheng Xiong, Ali Payani, James C. Kerce, and Faramarz Fekri. "Temporal Inductive Logic Reasoning over Hypergraphs." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/400.

Full text

Abstract:

Inductive logic reasoning is a fundamental task in graph analysis, which aims to generalize patterns from data. This task has been extensively studied for traditional graph representations, such as knowledge graphs (KGs), using techniques like inductive logic programming (ILP). Existing ILP methods assume learning from KGs with static facts and binary relations. Beyond KGs, graph structures are widely present in other applications such as procedural instructions, scene graphs, and program executions. While ILP is beneficial for these applications, applying it to those graphs is nontrivial: the

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Temporal Logic Reasoning"

1

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.

Full text

Abstract:

Recently, a lot of research has combined description logics (DLs) of the DL-Lite family with temporal formalisms. Such logics are proposed to be used for situation recognition and temporalized ontology-based data access. In this report, we consider DL-Lite-LTL, in which axioms formulated in a member of the DL-Lite family are combined using the operators of propositional linear-time temporal logic (LTL). We consider the satisfiability problem of this logic in the presence of so-called rigid symbols whose interpretation does not change over time. In contrast to more expressive temporalized DLs,

APA, Harvard, Vancouver, ISO, and other styles

2

Lutz, Carsten. Interval-based Temporal Reasoning with General TBoxes. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.109.

Full text

Abstract:

Aus der Motivation: Description Logics (DLs) are a family of formalisms well-suited for the representation of and reasoning about knowledge. Whereas most Description Logics represent only static aspects of the application domain, recent research resulted in the exploration of various Description Logics that allow to, additionally, represent temporal information, see [4] for an overview. The approaches to integrate time differ in at least two important aspects: First, the basic temporal entity may be a time point or a time interval. Second, the temporal structure may be part of the semantics (y

APA, Harvard, Vancouver, ISO, and other styles

3

Baader, Franz, Silvio Ghilardi, and Carsten Lutz. LTL over Description Logic Axioms. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.164.

Full text

Abstract:

Most of the research on temporalized Description Logics (DLs) has concentrated on the case where temporal operators can occur within DL concept descriptions. In this setting, reasoning usually becomes quite hard if rigid roles, i.e., roles whose interpretation does not change over time, are available. In this paper, we consider the case where temporal operators are allowed to occur only in front of DL axioms (i.e., ABox assertions and general concept inclusion axioms), but not inside of concepts descriptions. As the temporal component, we use linear temporal logic (LTL) and in the DL component

APA, Harvard, Vancouver, ISO, and other styles

4

Basu, Saikat, Malcolm Stagg, Robert DiBiano, Manohar Karki, and Supratik Mukhopadhyay. Human Action Recognition in Surveillance Videos using Abductive Reasoning on Linear Temporal Logic. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada586486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bourgaux, Camille, and Anni-Yasmin Turhan. Temporal Query Answering in DL-Lite over Inconsistent Data. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.236.

Full text

Abstract:

In ontology-based systems that process data stemming from different sources and that is received over time, as in context-aware systems, reasoning needs to cope with the temporal dimension and should be resilient against inconsistencies in the data. Motivated by such settings, this paper addresses the problem of handling inconsistent data in a temporal version of ontology-based query answering. We consider a recently proposed temporal query language that combines conjunctive queries with operators of propositional linear temporal logic and extend to this setting three inconsistency-tolerant se

APA, Harvard, Vancouver, ISO, and other styles

6

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.214.

Full text

Abstract:

Context-aware systems use data about their environment for adaptation at runtime, e.g., for optimization of power consumption or user experience. Ontology-based data access (OBDA) can be used to support the interpretation of the usually large amounts of data. OBDA augments query answering in databases by dropping the closed-world assumption (i.e., the data is not assumed to be complete any more) and by including domain knowledge provided by an ontology. We focus on a recently proposed temporalized query language that allows to combine conjunctive queries with the operators of the well-known pr

APA, Harvard, Vancouver, ISO, and other styles

7

Koopmann, Patrick. Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.242.

Full text

Abstract:

Especially in the field of stream reasoning, there is an increased interest in reasoning about temporal data in order to detect situations of interest or complex events. Ontologies have been proved a useful way to infer missing information from incomplete data, or simply to allow for a higher order vocabulary to be used in the event descriptions. Motivated by this, ontology-based temporal query answering has been proposed as a means for the recognition of situations and complex events. But often, the data to be processed do not only contain temporal information, but also probabilistic informat

APA, Harvard, Vancouver, ISO, and other styles

8

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text

Abstract:

Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com

APA, Harvard, Vancouver, ISO, and other styles

9

Horrocks, Ian, and Stephan Tobies. Optimisation of Terminological Reasoning. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.99.

Full text

Abstract:

An extended abstract of this report was submitted to the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000). When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively inexpressive logics, and it is essential to deal with such axioms in an efficient manner if implemented systems are to be effective in real applications. This is particularly relevant to Description Logics, whe

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!