2000 character limit reached
The Complexity of Learning Linear Temporal Formulas from Examples
Published 1 Feb 2021 in cs.FL, cs.LG, and cs.LO | (2102.00876v1)
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 approximation of the fragment containing only the next operator and conjunctions, and prove NP-completeness results for many fragments.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.