\textsf{lazyCoP}: lazy paramodulation meets neurally guided search
From MaRDI portal
Publication:2142075
DOI10.1007/978-3-030-86059-2_11OpenAlexW3196948051MaRDI QIDQ2142075
Publication date: 25 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_11
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MPTP 0.2: Design, implementation, and initial experiments
- Connection tableaux with lazy paramodulation
- The CADE-14 ATP system competition
- Controlled integration of the cut rule into connection tableau calculi
- Limited resource strategy in resolution theorem proving
- TacticToe: learning to prove with tactics
- Layered clause selection for theory reasoning (short paper)
- A neurally-guided, parallel theorem prover
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
- Old or heavy? Decaying gracefully with age/weight shapes
- Monte Carlo tableau proof search
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving
- Internal Guidance for Satallax
- MaLeCoP Machine Learning Connection Prover
- FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Restricting backtracking in connection calculi
- Deep Network Guided Proof Search
- Make E Smart Again (Short Paper)
- Prolog Technology Reinforcement Learning Prover
- Sledgehammer: Judgement Day
This page was built for publication: \textsf{lazyCoP}: lazy paramodulation meets neurally guided search
