A vision for automated deduction rooted in the connection method

DOI10.1007/978-3-319-66902-1_1zbMATH Open1496.68363OpenAlexW2750714633MaRDI QIDQ1694445FDOQ1694445

Authors: Wolfgang Bibel 

Publication date: 2 February 2018

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

Recommendations

• scientific article; zbMATH DE number 4094863
• scientific article; zbMATH DE number 3992946
• scientific article; zbMATH DE number 194631
• scientific article; zbMATH DE number 4209640
• scientific article; zbMATH DE number 1543301

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)