\textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TacticToe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3196948051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sledgehammer: Judgement Day / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Guidance for Satallax / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo tableau proof search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TacticToe: learning to prove with tactics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered clause selection for theory reasoning (short paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Make E Smart Again (Short Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled integration of the cut rule into connection tableau calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deep Network Guided Proof Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricting backtracking in connection calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection tableaux with lazy paramodulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neurally-guided, parallel theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old or heavy? Decaying gracefully with age/weight shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited resource strategy in resolution theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CADE-14 ATP system competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPTP 0.2: Design, implementation, and initial experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaLeCoP Machine Learning Connection Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prolog Technology Reinforcement Learning Prover / rank
 
Normal rank

Latest revision as of 03:24, 29 July 2024

scientific article
Language Label Description Also known as
English
\textsf{lazyCoP}: lazy paramodulation meets neurally guided search
scientific article

    Statements

    \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (English)
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references