A scalable anytime algorithm for learning fragments of linear temporal logic
Crossref DOI link: https://doi.org/10.1007/s10703-025-00489-y
Published Online: 2026-01-08
Published Print: 2026-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Raha, Ritam
Roy, Rajarshi
Fijalkow, Nathanaƫl
Neider, Daniel
Text and Data Mining valid from 2026-01-08
Version of Record valid from 2026-01-08
Article History
Received: 8 February 2024
Accepted: 15 October 2025
First Online: 8 January 2026
Declaration
:
: The authors declare no competing interests.