Results 11 to 20 of about 283,349 (325)

Linear Temporal Logic for Regular Cost Functions [PDF]

open access: yesLogical Methods in Computer Science, 2014
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties.
Denis Kuperberg
doaj   +10 more sources

The Complexity of Generalized Satisfiability for Linear Temporal Logic [PDF]

open access: yesLogical Methods in Computer Science, 2009
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used.
Michael Bauland   +4 more
doaj   +8 more sources

A Metric for Linear Temporal Logic

open access: yes, 2018
We propose a measure and a metric on the sets of infinite traces generated by a set of atomic propositions. To compute these quantities, we first map properties to subsets of the real numbers and then take the Lebesgue measure of the resulting sets.
Iannopollo, Antonio   +4 more
core   +3 more sources

On Relaxing Metric Information in Linear Temporal Logic [PDF]

open access: yes2011 Eighteenth International Symposium on Temporal Representation and Reasoning, 2011
Metric LTL formulas rely on the next operator to encode time distances, whereas qualitative LTL formulas use only the until operator. This paper shows how to transform any metric LTL formula M into a qualitative formula Q, such that Q is satisfiable if ...
Furia, Carlo A., Spoletini, Paola
core   +5 more sources

Backdoors for Linear Temporal Logic. [PDF]

open access: yesAlgorithmica, 2019
In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized by the size of the backdoor.
Meier A   +3 more
europepmc   +8 more sources

Towards an algebrization of a linear temporal logic

open access: diamondCQD Revista Eletrônica Paulista de Matemática
The subject of this paper is the Propositional Neighbourhood Logic (PNL), a case of linear temporal logic and an extension of Classical Propositional Logic that results from the inclusion of modal operators that deal with certain temporal aspects.
Romulo Albano de Freitas   +2 more
doaj   +2 more sources

Transformational Verification of Linear Temporal Logic [PDF]

open access: yes, 2009
We present a new method for verifying Linear Temporal Logic (LTL) properties of finite state reactive systems based on logic programming and program transformation.
Pettorossi, Alberto   +2 more
core   +4 more sources

Unification in linear temporal logic LTL

open access: bronzeAnnals of Pure and Applied Logic, 2011
AbstractWe prove that a propositional Linear Temporal Logic with Until and Next (LTL) has unitary unification. Moreover, for every unifiable in LTL formula A there is a most general projective unifier, corresponding to some projective formula B, such that A is derivable from B in LTL. On the other hand, it can be shown that not every open and unifiable
Sergey Babenyshev, Vladimir V. Rybakov
openalex   +3 more sources

Standpoint Linear Temporal Logic

open access: yesProceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023
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 ...
Gigante, Nicola   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy