Concepts de base
The addition of temporal neighborhood modality increases the complexity and expressiveness of logic.
Résumé
The content discusses the complexity of satisfiability problems in Interval Temporal Logics, focusing on the logic of prefixes and sub-intervals. It introduces the concept of homogeneous models and compass structures to simplify proofs. The relationship between ITLs and generalized ∗-free regular expressions is explored, highlighting the importance of restricted expressions. The article concludes with a discussion on the satisfiability problem for BDhom under homogeneity.
Structure:
Introduction to Interval Temporal Logics (ITLs)
Expressive power vs. decidability trade-off
Logic BD of prefixes and infixes
Syntax, semantics, homogeneity assumption, finite satisfiability
Relationship with generalized ∗-free regular expressions
Mapping expressions to formulas in C, non-elementary hardness
Homogeneous compass structures
Definition of atoms, functions characterizing temporal behavior
Stats
A classic result by Stockmeyer states that the emptiness problem for generalized ∗-free regular expressions is non-elementarily decidable.
The satisfiability problem for BDhom under homogeneity has been shown to belong to ExpSpace.