Scalable Anytime Algorithms for Learning Fragments

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

doi:10.1007/978-3-030-99524-9_14

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Scalable Anytime Algorithms for Learning Fragments

MPS-Authors

/persons/resource/persons260725

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

/persons/resource/persons215577

Neider, Daniel
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)

Raha2022_Chapter_ScalableAnytimeAlgorithmsForLe.pdf
(Publisher version), 728KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Raha, R., Roy, R., Fijalkow, N., & Neider, D. (2022). Scalable Anytime Algorithms for Learning Fragments. In D. Fisman, & G. Rosu (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (pp. 263-280). Berlin: Springer. doi:10.1007/978-3-030-99524-9_14.

Cite as: https://hdl.handle.net/21.11116/0000-000A-9951-E

Abstract

There is no abstract available