Teaching Automated Theorem Proving by Example: PyRes 1.2
From MaRDI portal
Publication:5048999
DOI10.1007/978-3-030-51054-1_9OpenAlexW3038874144MaRDI QIDQ5048999
Publication date: 9 November 2022
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51054-1_9
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Faster, higher, stronger: E 2.3
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
- Using the TPTP Language for Writing Derivations and Finite Interpretations
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- A Machine-Oriented Logic Based on the Resolution Principle
This page was built for publication: Teaching Automated Theorem Proving by Example: PyRes 1.2