Bayesian ranking for strategy scheduling in automated theorem provers
From MaRDI portal
Publication:2104545
DOI10.1007/978-3-031-10769-6_33OpenAlexW4289104048MaRDI QIDQ2104545FDOQ2104545
Sean B. Holden, Lawrence C. Paulson, Chaitanya Mangla
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_33
Recommendations
- scientific article; zbMATH DE number 1696564
- scientific article
- Bayesian strategies: probabilistic programs as generalised graphical models
- The search efficiency of theorem proving strategies
- Automated reasoning for probabilistic sequential programs with theorem proving
- scientific article
- Publication:4941840
- scientific article; zbMATH DE number 1941939
Cites Work
- Title not available (Why is that?)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Detecting Novel Associations in Large Data Sets
- Title not available (Why is that?)
- Machine learning. A probabilistic perspective
- Title not available (Why is that?)
- 10.1162/15324430152748236
- Optimal scaling for various Metropolis-Hastings algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bayesian learning for neural networks
- Bayesian Reasoning and Machine Learning
- Machine learning for first-order theorem proving
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- Automated Reasoning with Analytic Tableaux and Related Methods
- MedleySolver: online SMT algorithm selection
- Dyad ranking using Plackett-Luce models based on joint feature representations
Cited In (1)
Uses Software
This page was built for publication: Bayesian ranking for strategy scheduling in automated theorem provers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104545)
