A framework is developed that extends calculi for propositional, modal and predicate logics to calculi for team-based logics. This method is applied to classical and quantified propositional logic, first-order logic and the modal logic K. Complete axiomatizations for propositional team logic PTL, quantified propositional team logic QPTL, modal team logic MTL and the dependence-atom-free fragmen...

Classical linear-time temporal logic (LTL) is capable of specifying of and reasoning about infinite behaviors only. While this is appropriate for specifying non-terminating reactive systems, there are situations (e. g., assumeguarantee reasoning, run-time verification) when it is desirable to be able to reason about finite and infinite behaviors. We propose an interpretation of the operators of...

Temporal description logics (TDLs) have been studied by many researchers (see e.g., [1, 10] for surveys and [4, 2, 15] for recent or important results). These TDLs are, however, not compatible in the following sense: these are not embeddable into the standard (non-temporal) description logics (DLs), and hence the existing algorithms for testing satisfiability in the standard DLs are not availab...

Existing work in temporal logic on representing the execution of infinitely many transactions, uses linear-time temporal logic (LTL) and only models two-step transactions. In this paper, we use the comparatively efficient branching-time computational tree logic CTL and extend the transaction model to a class of multistep transactions, by introducing distinguished propositional variables to repr...

The model checking problem has thoroughly been explored in the context of standard point-based temporal logics, such as LTL, CTL, and CTL⇤, whereas model checking for interval temporal logics has been brought to the attention only very recently. In this paper, we prove that the model checking problem for the logic of Allen’s relations started-by and finished-by is highly intractable, as it can ...

In recent work [1, 2] we have proposed the event order logic (EOL) which is used to reason about the occurrence and order of events in formal system models. In this paper we will discuss the relationship of the event order logic and the linear temporal logic and further more show how EOL formulas can be translated into LTL formulas.

We study the synthesis problem for specifications of the common fragment of ACTL (computation tree logic with only universal path quantification) and LTL (linear-time temporal logic). Key to this setting is a novel construction for translating properties from LTL to very-weak automata, whenever possible. Such automata are structurally simple and thus amenable to optimizations as well as symboli...

We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as temporal formulas is used to effectively control forward chaining. Instead of using a linear modal tense logic as with Bacchus and Kabanza, we use TAL, a narrative-based linear temporal logic used for reasoning about acti...

A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling HyperLTL to express information-flow security policies that LTL cannot. A model-checking algorithm for a fragment of HyperLTL is given, and the algorithm is imple...

We introduce logics and automata based on memory event clocks. A memory clock is not really reset: instead, a new clock is created, while the old one is still accessible by indexing. We can thus constrain not only the time since the last reset (which was the main limitation in event clocks), but also since previous resets. When we introduce these clocks in the linear temporal logic of the reals...