SAT-based learning of computation tree logic

DOI10.1007/978-3-031-63498-7_22MaRDI QIDQ7034854zbMATH OpenFDO

Authors Adrien Pommellet, Daniel Stan, Simon Scatton

Publication date 31 January 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

computation tree logicSAT solvingpassive learning

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1799521 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 1953038 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Automata, Languages and Programming
• Characterizing finite Kripke structures in propositional temporal logic
• From Spot 2.0 to Spot 2.10: What’s New?
• Learning linear temporal properties from noisy data: a MaxSAT-based approach
• Myths about the mutual exclusion problem

Cited in

(1)

• A framework for computing upper bounds in passive learning settings

This page was built for publication: SAT-based learning of computation tree logic

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