[edit]

# The complexity of learning linear temporal formulas from examples

*Proceedings of the Fifteenth International Conference on Grammatical Inference*, PMLR 153:237-250, 2021.

#### Abstract

In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we obtain tight bounds for the fragment containing only the next operator and conjunctions, and prove NP-hardness results for many fragments.