✦ LIBER ✦

A Pragmatic Approach to Reuse in Tactical Theorem Proving

✍ Scribed by Axel Schairer; Serge Autexier; Dieter Hutter

Book ID: 108498215
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 238 KB
Volume: 58
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00286-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel approach for theorem proving

A parallel approach for theorem proving in prepositional logic

✍ Chen Wen-Tsuen; Liu Lung-Lung 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 948 KB

An approach to a systematic theorem prov

An approach to a systematic theorem proving procedure in first-order logic

✍ W. Bibel 📂 Article 📅 1974 🏛 Springer Vienna 🌐 English ⚖ 860 KB

Finite approach to the problem of optimi

Finite approach to the problem of optimizing theorem-proving algorithms

✍ A. O. Slisenko 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 554 KB

A Deductive Database Approach to Automat

A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering

✍ Shang-Ching Chou; Xiao-Shan Gao; Jing-Zhong Zhang 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 158 KB

A New Approach for Automatic Theorem Pro

A New Approach for Automatic Theorem Proving in Real Geometry

✍ Andreas Dolzmann; Thomas Sturm; Volker Weispfenning 📂 Article 📅 1998 🏛 Springer Netherlands 🌐 English ⚖ 161 KB

Refinements to depth-first iterative-dee

Refinements to depth-first iterative-deepening search in automatic theorem proving

✍ Xumin Nie; David A. Plaisted 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 639 KB

This paper will dzscuss two refinements to the depth-first tteratlve-deepemng search strategy The first refinement, the priority system, ts an attempt to simulate best-first search usmg depth-first tterattvedeepenmg search A new data structure, the priority hst, ts introduced mto depth-first tteratt