First Page | Document Content | |
---|---|---|
Date: 2016-06-17 09:50:06Formal methods Automated theorem proving Logic in computer science Boolean algebra Electronic design automation Conflict-Driven Clause Learning Boolean satisfiability problem Satisfiability modulo theories Clause Vampire Propositional calculus Lambda calculus | A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2Add to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 189,65 KBShare Document on Facebook |
The Vampire and the FOOL Evgenii Kotelnikov Laura Kov´acs Giles RegerDocID: 1xVTD - View Document | |
Instantiation for Theory Reasoning in Vampire Giles Reger Theory Reasoning in saturation provers φDocID: 1xVzg - View Document | |
Instantiation for Theory Reasoning in Vampire Giles Reger Martin Riener University of Manchester, Manchester, UKDocID: 1xV20 - View Document | |
Instantiation and Pretending to be an SMT Solver with VAMPIRE ∗ Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3DocID: 1xUjf - View Document | |
Instantiation for Theory Reasoning in Vampire Giles Reger Martin RienerDocID: 1xTXS - View Document |