<--- Back to Details
First PageDocument Content
Formal methods / Theoretical computer science / Complexity classes / Automated theorem proving / Vampire / NP / IP / Mathematics / Constraint programming / Proof compression
Date: 2016-07-20 13:24:09
Formal methods
Theoretical computer science
Complexity classes
Automated theorem proving
Vampire
NP
IP
Mathematics
Constraint programming
Proof compression

Cooperating Proof Attempts Giles Reger, Dmitry Tishkovsky, and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. This paper introduces a pseudo-concurrent architecture for first-order saturation-based

Add to Reading List

Source URL: www.cs.man.ac.uk

Download Document from Source Website

File Size: 140,17 KB

Share Document on Facebook

Similar Documents