Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal 
Logic

Raha, Ritam; Roy, Rajarshi; Fijalkow, Nathanaël; Neider, Daniel

doi:10.21105/joss.05052

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic

MPS-Authors

/persons/resource/persons260725

Roy, Rajarshi
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

10.21105.joss.05052.pdf
(Publisher version), 209KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Raha, R., Roy, R., Fijalkow, N., & Neider, D. (2024). Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. The Journal of Open Source Software, 9(93): 5052, pp. 1-4. doi:10.21105/joss.05052.

Cite as: https://hdl.handle.net/21.11116/0000-000E-5788-7

Abstract

There is no abstract available