FEMaLeCoP

swMATH21179MaRDI QIDQ32991FDOQ32991

Author name not available (Why is that?)

Described by source

• FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover

Cited In (20)

• 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).
• A neurally-guided, parallel theorem prover
• nanoCoP: A Non-clausal Connection Prover
• Portfolio theorem proving and prover runtime prediction for geometry
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• The role of entropy in guiding a connection prover
• Towards finding longer proofs
• Machine learning guidance for connection tableaux
• TacticToe: learning to prove with tactics
• ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
• ENIGMA: efficient learning-based inference guiding machine
• Monte Carlo tableau proof search
• Internal Guidance for Satallax
• Craig interpolation with clausal first-order tableaux
• Deep Network Guided Proof Search
• Prolog Technology Reinforcement Learning Prover
• ProofWatch: watchlist guidance for large theories in E
• ATPboost: learning premise selection in binary setting with ATP feedback
• \textsf{lazyCoP}: lazy paramodulation meets neurally guided search

This page was built for software: FEMaLeCoP