We design temporal description logics (TDLs) suitable for reasoning about temporal
conceptual data models and investigate their computational complexity. Our formalisms are …

Linear temporal logic (LTL) is a modal logic where formulas are built over temporal
operators relating events happening in different time instants. According to the standard …

This paper focuses on LTL on finite traces (LTLf) for which satisfiability is known to be
PSPACE-complete. However, little is known about the computational properties of fragments …

We introduce and investigate a number of fragments of propositional temporal logic LTL
over the flow of time (ℤ,<). The fragments are defined in terms of the available temporal …

We consider the weighted satisfiability problem for Boolean circuits and propositional
formulæ, where the weight of an assignment is the number of variables set to true. We study …

We revisit the complexity of the model checking problem for formulas of linear-time temporal
logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a …

In this work, we present a novel technique to automatically generate satisfying and violating
traces for a Signal Temporal Logic (STL) formula. STL is a logic whose formulas are …

We present team semantics for two of the most important linear and branching time
specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL) …

The satisfiability problem of hybrid logics with the downarrow binder is known to be
undecidable. This initiated a research program on decidable and tractable fragments. In this …

Autoepistemic logic extends propositional logic by the modal operator L. A formula φ that is
preceded by an L is said to be “believed.” The logic was introduced by Moore in 1985 for …