<--- Back to Details
First PageDocument Content
Mathematical logic / Logic / Theoretical computer science / Automated theorem proving / Formal methods / Logic in computer science / Electronic design automation / Craig interpolation / Interpolation / Satisfiability modulo theories / Unit propagation / Resolution
Date: 2015-03-16 05:12:39
Mathematical logic
Logic
Theoretical computer science
Automated theorem proving
Formal methods
Logic in computer science
Electronic design automation
Craig interpolation
Interpolation
Satisfiability modulo theories
Unit propagation
Resolution

Journal of Automated Reasoning manuscript No. DOIs10817Interpolation Systems for Ground Proofs in Automated Deduction: a Survey Maria Paola Bonacina · Moa Johansson

Add to Reading List

Source URL: www.cse.chalmers.se

Download Document from Source Website

File Size: 327,69 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