<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic / Mathematical logic / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Nqthm / Rewrite order / Symbol
Date: 2011-06-16 09:07:59
Theoretical computer science
Logic
Mathematical logic
Automated theorem proving
Logic programming
Logical truth
Propositional calculus
Substitution
Nqthm
Rewrite order
Symbol

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨

Add to Reading List

Source URL: www.dcs.bbk.ac.uk

Download Document from Source Website

File Size: 335,48 KB

Share Document on Facebook

Similar Documents

Lecture Notes on Virtual Substitution & Real Arithmetic

Lecture Notes on Virtual Substitution & Real Arithmetic

DocID: 1xUTv - View Document

Towards Conflict-Driven Learning for Virtual Substitution SMT Workshop ˇ Marek Kosta (joint work K. Korovin and T. Sturm)

Towards Conflict-Driven Learning for Virtual Substitution SMT Workshop ˇ Marek Kosta (joint work K. Korovin and T. Sturm)

DocID: 1xUsN - View Document

LIVELIHOOD SUBSTITUTION: THE CASE OF THE LYARI EXPRESSWAY

LIVELIHOOD SUBSTITUTION: THE CASE OF THE LYARI EXPRESSWAY

DocID: 1vjHF - View Document

Hereditary Substitution for the λ∆-Calculus Harley Eades and Aaron Stump Computer Science CL&C 2012  Overview

Hereditary Substitution for the λ∆-Calculus Harley Eades and Aaron Stump Computer Science CL&C 2012 Overview

DocID: 1vi0p - View Document

Matthieu Fontaine - L’échec de la généralisation existentielle et de la substitution des identiques chez Hintikka

Matthieu Fontaine - L’échec de la généralisation existentielle et de la substitution des identiques chez Hintikka

DocID: 1vfiN - View Document