Satisfiability of temporal logics with concrete domain
From International Center for Computational Logic
Satisfiability of temporal logics with concrete domain
Talk by Claudia Carapelle
- Location: APB 3027
- Start: 25. May 2016 at 2:50 pm
- End: 25. May 2016 at 3:50 pm
- Research group: Automata Theory
- Event series: KBS Seminar
- iCal
We show how we can enrich linear- and branching-time temporal logics with the ability to talk about data words and data trees, where the data values are taken from a "concrete domain" D. We consider the satisfiability problem for such logics, and identify sufficient conditions on D to guarantee decidability.
