FEMaLeCoP

swMATH21179MaRDI QIDQ32991

No author found.

Described by source

• FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover

Related Items (20)

ENIGMA: efficient learning-based inference guiding machine ⋮ Prolog Technology Reinforcement Learning Prover ⋮ Portfolio theorem proving and prover runtime prediction for geometry ⋮ Towards finding longer proofs ⋮ \textsf{lazyCoP}: lazy paramodulation meets neurally guided search ⋮ The role of entropy in guiding a connection prover ⋮ The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics ⋮ Monte Carlo tableau proof search ⋮ Craig interpolation with clausal first-order tableaux ⋮ A neurally-guided, parallel theorem prover ⋮ Logic for programming, artificial intelligence, and reasoning. 20th international conference, LPAR-20 2015, Suva, Fiji, November 24--28, 2015. Proceedings ⋮ Hammering Mizar by Learning Clause Guidance (Short Paper). ⋮ Deep Network Guided Proof Search ⋮ TacticToe: learning to prove with tactics ⋮ Machine learning guidance for connection tableaux ⋮ ProofWatch: watchlist guidance for large theories in E ⋮ ATPboost: learning premise selection in binary setting with ATP feedback ⋮ nanoCoP: A Non-clausal Connection Prover ⋮ Internal Guidance for Satallax ⋮ ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)

This page was built for software: FEMaLeCoP