Model Checking Linear Temporal Logic with Standpoint Modalities
From International Center for Computational Logic
Model Checking Linear Temporal Logic with Standpoint Modalities
Talk by Rajab Aghamov
- Location: APB 3027
- Start: 15. May 2025 at 11:00 am
- End: 15. May 2025 at 12:00 pm
- Research group: Knowledge-Based Systems
- Research group: Algebraic and Logical Foundations of Computer Science
- Event series: Research Seminar Logic and AI
- iCal
Standpoint linear temporal logic (SLTL) is a recently introduced extension of classical linear temporal logic (LTL) with standpoint modalities. Intuitively, these modalities allow to express that, from agent a's standpoint, it is conceivable that a given formula holds. Besides the standard interpretation of the standpoint modalities, we introduce four new semantics, which differ in the information an agent can extract from the history. We provide a general model checking algorithm applicable to SLTL under any of the five semantics. Furthermore, we analyze the computational complexity of the corresponding model checking problems, obtaining PSPACE-completeness in three cases, which stands in contrast to the known EXPSPACE-completeness of the SLTL satisfiability problem.
