Automated Theorem Proving: Theory and Practice by Monty Newborn (English) Hardco
155,54 €
The two approaches studied are semantic tree theorem proving and resolution-refutation theorem proving. A brief introduction to COMPILE, HERBY and THEO. - Inference procedures. - Proving theorems by constructing closed semantic trees.
Jetzt bei Ebay:
