✦ LIBER ✦

leanCoP: lean connection-based theorem proving

✍ Scribed by Jens Otten; Wolfgang Bibel

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 372 KB
Volume: 36
Category: Article
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(03)00037-3

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Connection Calculus Theorem Proving with

Connection Calculus Theorem Proving with Multiple Built-in Theories

✍ Uwe Petermann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Gradually more applications of automated reasoning are discovered. This development has the consequence that deduction systems need to be increasingly flexible. They should exhibit a behavior appropriate to a given problem. One way to achieve this behavior is the integration of different systems or

Mechanical geometry theorem proving base

Mechanical geometry theorem proving based on groebner bases

✍ Jinzhao Wu 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 394 KB

Theorem proving based on the partial ins

Theorem proving based on the partial instantiation technique

✍ Masahito Yamamoto; Azuma Ohuchi; Toshio Ohyanagi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 643 KB

Linear strategy for boolean ring based t

Linear strategy for boolean ring based theorem proving

✍ Jinzhao Wu; Zhuojun Liu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 560 KB

On the relation between resolution based

On the relation between resolution based and completion based theorem proving

✍ 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

Implementing CLP(B) using the Connection

Implementing CLP(B) using the Connection Theorem Proving Method and a Clause Management Systems

✍ Greg Sidebottom 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Constraint Logic Programming (CLP) is an extension of logic programming to include efficient constraint processing algorithms for specialized computational domains. CLP(B) is a CLP language which processes constraints in Boolean algebra. The CLP(B) language can be used to solve many set theoretic an