The 10th IJCAR automated theorem proving system competition – CASC-J10
From MaRDI portal
Publication:5019796
DOI10.3233/AIC-201566zbMath1485.68287OpenAlexW4243308851MaRDI QIDQ5019796
Publication date: 11 January 2022
Published in: AI Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/aic-201566
Related Items (3)
The CADE-28 Automated Theorem Proving System Competition – CASC-28 ⋮ Making higher-order superposition work ⋮ Lash 1.0 (system description)
Uses Software
Cites Work
- Unnamed Item
- Connection tableaux with lazy paramodulation
- Limited resource strategy in resolution theorem proving
- Evaluating general purpose automated theorem proving systems
- The CADE-16 ATP system competition
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates
- A Knuth-Bendix-like ordering for orienting combinator equations
- A combinator-based superposition calculus for higher-order logic
- Subsumption demodulation in first-order theorem proving
- GRUNGE: a grand unified ATP challenge
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
- Combining proverif and automated theorem provers for security protocol verification
- Premise selection for mathematics by corpus analysis and kernel methods
- Detecting inconsistencies in large first-order knowledge bases
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- A Brief Overview of HOL4
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
- The CADE-26 automated theorem proving system competition – CASC-26
- Hierarchical invention of theorem proving strategies
- The CADE-27 Automated theorem proving System Competition – CASC-27
- Hammering towards QED
- Superposition with lambdas
This page was built for publication: The 10th IJCAR automated theorem proving system competition – CASC-J10
