Scheduling methods for parallel automated theorem proving

DOI10.1007/3-540-45486-1_21MaRDI QIDQ2766732zbMATH OpenFDO

Authors Gernot Stenz, Andreas Wolf

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45486-1_21

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• E-SETHEO: An automated^3 theorem prover
• Bayesian ranking for strategy scheduling in automated theorem provers
• E-MaLeS 1.1
• scientific article; zbMATH DE number 1552517
• Hierarchical invention of theorem proving strategies

Cited in

(7)

• Bayesian ranking for strategy scheduling in automated theorem provers
• Provable algorithms for parallel generalized sweep scheduling
• E-SETHEO: An automated^3 theorem prover
• MaLeS: a framework for automatic tuning of automated theorem provers
• E-MaLeS 1.1
• scientific article; zbMATH DE number 7362744 (Why is no real title available?)
• Hierarchical invention of theorem proving strategies

Describes a project that uses

Uses Software

• SETHEO

This page was built for publication: Scheduling methods for parallel automated theorem proving

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