Sciweavers

425 search results - page 12 / 85
» The TPS Theorem Proving System
Sort
View
CADE
2000
Springer
15 years 2 months ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz
77
Voted
TPHOL
1999
IEEE
15 years 1 months ago
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
Markus Wenzel
FCSC
2007
133views more  FCSC 2007»
14 years 9 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
SYNTHESE
2008
88views more  SYNTHESE 2008»
14 years 9 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
ECAI
2004
Springer
15 years 1 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