Sciweavers

6 search results - page 1 / 2
» Generating Readable Proofs: A Heuristic Approach to Theorem ...
Sort
View
DIAGRAMS
2004
Springer
13 years 10 months ago
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...
Jean Flower, Judith Masthoff, Gem Stapleton
ADG
2000
Springer
122views Mathematics» more  ADG 2000»
13 years 9 months ago
Automated Theorem Proving in Incidence Geometry - A Bracket Algebra Based Elimination Method
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...
Hongbo Li, Yihong Wu
TABLEAUX
2000
Springer
13 years 8 months ago
Matrix-Based Inductive Theorem Proving
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
Christoph Kreitz, Brigitte Pientka
JAR
2000
97views more  JAR 2000»
13 years 4 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
ECAI
2004
Springer
13 years 8 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease