0 references
Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO
Lecture notes in computer science2000pp. 431–435
Related Papers
- → A theorem prover for a computational logic(1990)50 cited
- → Providing automated support to deductive analysis of time critical systems(1997)3 cited
- A Study of Polya's Enumeration Theorem(2005)
- → Conclusions(2001)