A framework for computing upper bounds in passive learning settings

DOI10.1007/978-3-032-04590-4_16MaRDI QIDQ6884706zbMATH OpenFDO

Authors Benjamin Bordais, Daniel Neider

Publication date 15 December 2025

zbMATH Keywords

temporal logicstopping criterionpassive learning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• scientific article; zbMATH DE number 1670794 (Why is no real title available?)
• scientific article; zbMATH DE number 2133276 (Why is no real title available?)
• A decision tree approach to data classification using signal temporal logic
• A logic for reasoning about time and reliability
• Complexity of automaton identification from given data
• Interpretable classification of time-series data using efficient enumerative techniques
• Modal logic
• On the complexity of minimum inference of regular sets
• Regular expressions: new results and open problems
• SAT-based learning of computation tree logic
• Scalable anytime algorithms for learning fragments of linear temporal logic

This page was built for publication: A framework for computing upper bounds in passive learning settings

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