A vision for automated deduction rooted in the connection method

DOI10.1007/978-3-319-66902-1_1MaRDI QIDQ1694445zbMATH OpenOpenAlexFDO

Authors Wolfgang Bibel

Publication date 2 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66902-1_1

zbMATH Keywords

automated deductionautomated theorem provingconnection methodleanCoP

Mathematics Subject Classification ID

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

Cited in

(7)

• A connectionist approach for learning search-control heuristics for automated deduction systems (Thesis, TU München, 1997)
• A new methodology for developing deduction methods
• scientific article; zbMATH DE number 194631 (Why is no real title available?)
• From Schütte’s Formal Systems to Modern Automated Deduction
• The role of entropy in guiding a connection prover
• Machine learning guidance for connection tableaux
• scientific article; zbMATH DE number 549993 (Why is no real title available?)

This page was built for publication: A vision for automated deduction rooted in the connection method

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