Sciweavers

1410 search results - page 40 / 282
» Proving theorems by reuse
Sort
View
FCSC
2007
133views more  FCSC 2007»
15 years 1 months ago
Mathematics mechanization and applications after thirty years
The aim of mathematics mechanization is to develop symbolic algorithms for manipulating mathematical objects, proving and discovering theorems in a mechanical way. This paper gives...
Wenjun Wu, Xiaoshan Gao
ECAI
2004
Springer
15 years 5 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
CADE
2007
Springer
16 years 2 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe
HICSS
1994
IEEE
105views Biometrics» more  HICSS 1994»
15 years 6 months ago
A Methodology for Equational Reasoning
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
Jürgen Cleve, Dieter Hutter
136
Voted
ASM
2010
ASM
15 years 4 months ago
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
David Déharbe