Sciweavers

438 search results - page 23 / 88
» On theorem proving in annotated logics
Sort
View
CADE
2008
Springer
14 years 9 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
CADE
2004
Springer
14 years 9 months ago
The CADE ATP System Competition
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC se...
Geoff Sutcliffe, Christian B. Suttner
JAR
2007
83views more  JAR 2007»
13 years 8 months ago
Theory Extension in ACL2(r)
ACL2(r) is a modified version of the theorem prover ACL2 that adds support for the irrational numbers using non-standard analysis. It has been used to prove basic theorems of anal...
Ruben Gamboa, John R. Cowles
TPHOL
1999
IEEE
14 years 27 days 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
CSL
2007
Springer
14 years 2 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam