Learning search control knowledge for equational theorem proving
From MaRDI portal
Recommendations
Cited in
(18)- Automatic acquisition of search control knowledge from multiple proof attempts.
- Machine learning guidance for connection tableaux
- Towards the automatic mathematician
- Contradiction separation based dynamic multi-clause synergized automated deduction
- Machine learning for first-order theorem proving
- ENIGMA: efficient learning-based inference guiding machine
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- A connectionist approach for learning search-control heuristics for automated deduction systems (Thesis, TU München, 1997)
- Learning search control-knowledge for equational deduction
- scientific article; zbMATH DE number 1552520 (Why is no real title available?)
- scientific article; zbMATH DE number 1737186 (Why is no real title available?)
- Learning domain knowledge to improve theorem proving
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
- MPTP-motivation, implementation, first experiments
- A multi-clause dynamic deduction algorithm based on standard contradiction separation rule
- Complete inference via knowledge Petri nets and resolution rules
- Learning guided automated reasoning: a brief survey
- Octopus: combining learning and parallel search
This page was built for publication: Learning search control knowledge for equational theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797437)