✦ LIBER ✦

Connection-Driven Inductive Theorem Proving

✍ Scribed by Christoph Kreitz; Brigitte Pientka

Book ID: 110325080
Publisher: Springer Netherlands
Year: 2001
Tongue: English
Weight: 393 KB
Volume: 69
Category: Article
ISSN: 0039-3215
DOI: 10.1023/a:1013874024997

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analogy in Inductive Theorem Proving

✍ Erica Melis; Jon Whittle 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 218 KB

Inductive Theorem Proving for Design Spe

Inductive Theorem Proving for Design Specifications

✍ PETER PADAWITZ 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 985 KB

We present a number of new results on inductive theorem proving for design specifications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the specification. We show how the automatic support for program verification is enhanced if

leanCoP: lean connection-based theorem p

leanCoP: lean connection-based theorem proving

✍ 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.

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

Automated Theorem Proving by Test Set In

Automated Theorem Proving by Test Set Induction

✍ ADEL BOUHOULA 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 825 KB

Test set induction is a goal-directed proof technique which combines the full power of explicit induction and proof by consistency. It works by computing an appropriate explicit induction scheme called a test set, to trigger the induction proof, and then applies a refutation principle using proof by

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