![Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE](https://www.pdfsearch.io/img/7bc9c6a09434696499a5b0b1d9fec708.jpg) Date: 2016-07-20 13:24:35Theoretical computer science Automated theorem proving Mathematics Mathematical logic Formal methods Logic in computer science Resolution Logic programming Clause Vampire Boolean satisfiability problem CARINE | | Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search foAdd to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source Website File Size: 203,89 KBShare Document on Facebook
|