A theorem prover for a computational logic
Lecture notes in computer science1990pp. 1–15
Citations Over TimeTop 15% of 1990 papers
Related Papers
- → Automated termination proofs for haskell by term rewriting(2011)74 cited
- → Proving Confluence of Term Rewriting Systems Automatically(2009)46 cited
- → System Abstract: E 0.3(1999)23 cited
- → A superposition oriented theorem prover(1985)2 cited
- Using a first-order theorem prover in the SemAnTE framework(2013)