Scalable anytime algorithms for learning fragments of linear temporal logic

DOI10.1007/978-3-030-99524-9_14MaRDI QIDQ6535567zbMATH OpenFDO

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

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99524-9_14

zbMATH Keywords

artificial intelligencelinear temporal logicspecification mining

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

• LTL reactive synthesis with a few hints
• Succinctness of cosafety fragments of LTL via combinatorial proof systems
• Towards ILP-based \(\mathrm{LTL_f}\) passive learning
• A scalable anytime algorithm for learning fragments of linear temporal logic
• A framework for computing upper bounds in passive learning settings
• LTL reactive synthesis with a few hints
• Automatic assume-guarantee reasoning for safety and liveness using passive learning
• The complexity of learning LTL, CTL and ATL formulas

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)