<--- Back to Details
First PageDocument Content
Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE
Date: 2016-07-20 13:24:35
Theoretical 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 fo

Add to Reading List

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

Download Document from Source Website

File Size: 203,89 KB

Share Document on Facebook

Similar Documents

The Vampire and the FOOL Evgenii Kotelnikov Laura Kov´acs  Giles Reger

The Vampire and the FOOL Evgenii Kotelnikov Laura Kov´acs Giles Reger

DocID: 1xVTD - View Document

Instantiation for Theory Reasoning in Vampire Giles Reger Theory Reasoning in saturation provers  φ

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, UK

Instantiation for Theory Reasoning in Vampire Giles Reger Martin Riener University of Manchester, Manchester, UK

DocID: 1xV20 - View Document

Instantiation and Pretending to be an SMT Solver with VAMPIRE ∗ Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1  3

Instantiation and Pretending to be an SMT Solver with VAMPIRE ∗ Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

DocID: 1xUjf - View Document

Instantiation for Theory Reasoning in Vampire Giles Reger  Martin Riener

Instantiation for Theory Reasoning in Vampire Giles Reger Martin Riener

DocID: 1xTXS - View Document