Date: 2016-07-20 13:24:09Formal 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 ListSource URL: www.cs.man.ac.ukDownload Document from Source Website File Size: 140,17 KBShare Document on Facebook
|