Craig interpolation for linear temporal languages

Authors:
Amélie Gheerbrant;Balder Ten Cate
Affiliations:
ILLC, Universiteit van Amsterdam;INRIA and ENS Cachan
Venue:
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Year:
2009

Citing 5
Cited 0

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Languages, automata, and logic

Handbook of formal languages, vol. 3
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Automata on linear orderings

Journal of Computer and System Sciences
Partition-based logical reasoning for first-order and propositional theories

Artificial Intelligence - Special volume on reformulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of temporal connectives and, for each of these fragments, we identify its smallest extension that has Craig interpolation. Depending on the underlying set of temporal operators, this extension turns out to be one of the following three logics: the fragment of PLTL having only the Next operator; the extension of PLTL with a fixpoint operator µ (known as linear time µ-calculus); the fixpoint extension of the "Until-only" fragment of PLTL.