1 Hit in 6.7 sec

Teaching Automated Theorem Proving by Example: PyRes 1.2 [chapter]

Stephan Schulz, Adam Pease
2020 Lecture Notes in Computer Science  
PyRes is a complete theorem prover for classical first-order logic. It is not designed for high performance, but to clearly demonstrate the core concepts of a saturating theorem prover.  ...  Equality is handled by adding the basic axioms of equality. PyRes uses the given-clause algorithm, optionally controlled by weight-and age evaluations for clause selection.  ...  Conclusion We have described PyRes, a theorem prover developed as a pedagogical example to demonstrate saturation-based theorem proving in an accessible, readable, welldocumented way.  ... 
doi:10.1007/978-3-030-51054-1_9 fatcat:zkqfaei4cfanjjmn6zxfh5h3xu