๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Mechanical geometry theorem proving based on groebner bases

โœ Scribed by Jinzhao Wu


Publisher
Springer
Year
1997
Tongue
English
Weight
394 KB
Volume
12
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the relation between resolution based
โœ Rolf Socher ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 951 KB

Completion theorem proving, as proposed by J. Hsiang (1982), is based on the observation that proving a first order formula is equivalent to solving an equational system over a boolean polynomial ring. The latter can be accomplished by completing the set of rewrite rules obtained from the equational

leanCoP: lean connection-based theorem p
โœ Jens Otten; Wolfgang Bibel ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

The Prolog program implements a theorem prover for classical first-order (clausal) logic which is based on the connection calculus. It is sound and complete (provided that an arbitrarily large I is iteratively given), and demonstrates a comparatively strong performance.