Scalable anytime algorithms for learning fragments of linear temporal logic

DOI10.1007/978-3-030-99524-9_14zbMATH Open1547.6845MaRDI QIDQ6535567

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

Publication date: 23 January 2024

zbMATH Keywords

artificial intelligencelinear temporal logicspecification mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Temporal logic motion planning for dynamic robots
• Syntax-guided rewrite rule enumeration for SMT solvers
• A Decision Tree Approach to Data Classification using Signal Temporal Logic
• Analytical approach to parallel repetition

Related Items (2)

LTL reactive synthesis with a few hints ⋮ Succinctness of cosafety fragments of LTL via combinatorial proof systems

This page was built for publication: Scalable anytime algorithms for learning fragments of linear temporal logic