Towards finding longer proofs
From MaRDI portal
Publication:2142073
DOI10.1007/978-3-030-86059-2_10OpenAlexW3202968181MaRDI QIDQ2142073
Zsolt Zombori, Josef Urban, Cezary Kaliszyk, Henryk Michalewski, Adrián Csiszárik
Publication date: 25 May 2022
Full work available at URL: https://arxiv.org/abs/1905.13100
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
- Meeting the challenge of fifty years of logic
- Shortest single axioms for the classical equivalential calculus
- A shortest single axiom for the classical equivalential calculus
- IeanCOP: lean connection-based theorem proving
- Isabelle/HOL. A proof assistant for higher-order logic
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Using hints to increase the effectiveness of an automated reasoning program: Case studies
- Knowledge-based proof planning
- Guiding inferences in connection tableau by recurrent neural networks
- First neural conjecturing datasets and experiments
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
- ENIGMA: efficient learning-based inference guiding machine
- System Description: E 1.8
- Satisfiability Modulo Theories
- FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
- MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
- Deep Network Guided Proof Search
- Term Rewriting and All That
- Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
- Prolog Technology Reinforcement Learning Prover
- HOList
This page was built for publication: Towards finding longer proofs
