Prolog Technology Reinforcement Learning Prover
From MaRDI portal
Publication:5049033
DOI10.1007/978-3-030-51054-1_33OpenAlexW3102252921MaRDI QIDQ5049033
Zsolt Zombori, Josef Urban, Chad Edward Brown
Publication date: 9 November 2022
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.06997
Related Items (5)
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 ⋮ Eliminating models during model elimination
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MizAR 40 for Mizar 40
- MPTP 0.2: Design, implementation, and initial experiments
- On connections and higher-order logic
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- IeanCOP: lean connection-based theorem proving
- lean\(T^ AP\): Lean tableau-based deduction
- ENIGMAWatch: ProofWatch meets ENIGMA
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
- Premise selection for mathematics by corpus analysis and kernel methods
- ENIGMA: efficient learning-based inference guiding machine
- SWI-Prolog
- MaLeCoP Machine Learning Connection Prover
- MleanCoP: A Connection Prover for First-Order Modal Logic
- Efficient description logic reasoning in Prolog: The DLog system
- 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)
- MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
- Inductive Logic Programming: Theory and methods
- Deep Network Guided Proof Search
This page was built for publication: Prolog Technology Reinforcement Learning Prover
