Scalable anytime algorithms for learning fragments of linear temporal logic

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

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

Publication date: 23 January 2024

Recommendations

• Learning linear temporal properties from noisy data: a MaxSAT-based approach
• LTL goal specifications revisited
• TeLEx: learning signal temporal logic from positive examples using tightness metric
• Linear temporal logic -- from infinite to finite horizon

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

• Analytic combinatorics
• Temporal logic motion planning for dynamic robots
• Analytical approach to parallel repetition
• A decision tree approach to data classification using signal temporal logic
• Syntax-guided rewrite rule enumeration for SMT solvers

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535567)