A combinator language for theorem discovery

DOI10.1007/978-3-642-31374-5_25MaRDI QIDQ2907337zbMATH OpenOpenAlexFDO

Authors Phil Scott, Jacques D. Fleuriot

Publication date 7 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31374-5_25

Mathematics Subject Classification ID

Recommendations

• Composable discovery engines for interactive theorem proving
• Lemma discovery for induction. A survey
• Lemma discovery in automating induction
• Proof-pattern recognition and lemma discovery in ACL2
• An introduction to automated discovery in geometry through symbolic computation

Cited in

(1)

• Composable discovery engines for interactive theorem proving

This page was built for publication: A combinator language for theorem discovery

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