Bayesian ranking for strategy scheduling in automated theorem provers

DOI10.1007/978-3-031-10769-6_33MaRDI QIDQ2104545zbMATH OpenOpenAlexFDO

Authors Chaitanya Mangla, Sean B. Holden, Lawrence C. Paulson

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-10769-6_33

zbMATH Keywords

automated theorem provingBayesian machine learningstrategy scheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696564
• scientific article; zbMATH DE number 67963
• 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; zbMATH DE number 4164169
• Publication:4941840
• scientific article; zbMATH DE number 1941939

Cites work

• scientific article; zbMATH DE number 1809862 (Why is no real title available?)
• scientific article; zbMATH DE number 3152611 (Why is no real title available?)
• scientific article; zbMATH DE number 2038320 (Why is no real title available?)
• scientific article; zbMATH DE number 1478228 (Why is no real title available?)
• Title not available (Why is no real title available?)
• 10.1162/15324430152748236
• A formal proof of the Kepler conjecture
• Automated Reasoning with Analytic Tableaux and Related Methods
• Bayesian learning for neural networks
• Detecting novel associations in large data sets
• Dyad ranking using Plackett-Luce models based on joint feature representations
• Gaussian processes for machine learning.
• Machine learning for first-order theorem proving
• Machine learning. A probabilistic perspective
• MedleySolver: online SMT algorithm selection
• Optimal scaling for various Metropolis-Hastings algorithms.
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

Cited in

(3)

• Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
• scientific article; zbMATH DE number 1696564 (Why is no real title available?)
• Goal-sensitive reasoning with disconnection tableaux

Describes a project that uses

Uses Software

• MedleySolver
• MachSMT
• kepler98
• PMTK
• E Theorem Prover
• FaCT++
• ileanCoP
• leanCoP
• TPTP
• Matlab

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)