Learning computation tree logic with neural networks

DOI10.1007/978-3-032-32589-1_24MaRDI QIDQ7411181zbMATH OpenFDO

Authors Benjamin Bordais, Daniel Neider, Mustafa Yalçıner

Publication date 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-32589-1_24

zbMATH Keywords

neural networksspecification miningtemporal logic

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• Alternating-time temporal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Handbook of model checking
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Learning guided automated reasoning: a brief survey
• Learning linear temporal properties from noisy data: a MaxSAT-based approach
• Learning regular sets from queries and counterexamples
• Runtime verification past experiences and future projections
• SAT-based learning of computation tree logic
• The complexity of learning LTL, CTL and ATL formulas

This page was built for publication: Learning computation tree logic with neural networks

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