<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic / Mathematical logic / Logic in computer science / Artificial intelligence / Automated reasoning / Automated theorem proving / Predicate logic / Quantifier / Andrei Voronkov / Z3 / Alt-Ergo
Date: 2016-10-06 05:17:59
Theoretical computer science
Logic
Mathematical logic
Logic in computer science
Artificial intelligence
Automated reasoning
Automated theorem proving
Predicate logic
Quantifier
Andrei Voronkov
Z3
Alt-Ergo

AVATAR Modulo Theories Nikolaj Bjøner1 Giles Reger2 Martin Suda3 Andrei Voronkov2,4,5 1 Microsoft Research, Redmond, USA University of Manchester, Manchester, UK

Add to Reading List

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

Download Document from Source Website

File Size: 594,13 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document