<--- Back to Details
First PageDocument Content
Logic / Abstraction / Philosophy / Automated theorem proving / Reasoning / Formal methods / Predicate logic / Datalog / First-order logic / Axiom / Satisfiability modulo theories / Mereology
Date: 2007-08-16 08:58:53
Logic
Abstraction
Philosophy
Automated theorem proving
Reasoning
Formal methods
Predicate logic
Datalog
First-order logic
Axiom
Satisfiability modulo theories
Mereology

Microsoft Word - BlankPage

Add to Reading List

Source URL: www.cs.miami.edu

Download Document from Source Website

File Size: 2,74 MB

Share Document on Facebook

Similar Documents

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

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

DocID: 1sOSK - View Document

Logic / Abstraction / Philosophy / Automated theorem proving / Reasoning / Formal methods / Predicate logic / Datalog / First-order logic / Axiom / Satisfiability modulo theories / Mereology

Microsoft Word - BlankPage

DocID: 1rugC - View Document

Theoretical computer science / Computing / Software engineering / Logic in computer science / Automated theorem proving / Static program analysis / Termination analysis / Rewriting / KeY / Automated reasoning / Bytecode / Christoph Walther

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

DocID: 1rrok - View Document