Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs ∗ J¨urgen Giesl Thomas Str¨oder - Thomas theorem - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-07-18 09:07:52 Logic Mathematical logic Theoretical computer science Automated theorem proving Logic programming Logic in computer science Type theory Logical truth Substitution Unification Admissible rule Symbol		Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs ∗ J¨urgen Giesl Thomas Str¨oder Add to Reading List Source URL: www.dcs.bbk.ac.uk Download Document from Source Website File Size: 490,57 KB Share Document on Facebook

	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
	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 DocID: 1rrok - View Document