Ivy: A Preprocessor And Proof Checker For First-Order Logic

Ivy: A Preprocessor And Proof Checker For First-Order Logic (1999)

Cached

Download Links

[info.mcs.anl.gov]

by William Mccune , Olga Shumsky

Citations:

24 - 8 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Ivy: A Preprocessor And Proof Checker For First-Order Logic	user correction - Legacy Corrections
AUTHOR NAME	William Mccune	SVM HeaderParse 0.1
AUTHOR AFFIL	Mathematics and Computer Science Division; Argonne National Laboratory	SVM HeaderParse 0.2
AUTHOR NAME	Olga Shumsky	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Electrical and Computer Engineering; Northwestern University	SVM HeaderParse 0.2
ABSTRACT	This case study shows how non-ACL2 programs can be combined with ACL2 functions in such a way that useful properties can be proved about the composite programs. Nothing is proved about the non-ACL2 programs. Instead, the results of the non-ACL2 programs are checked at run time by ACL2 functions, and properties of these checker functions are proved. The application is resolution/paramodulation automated theorem proving for first-order logic. The top ACL2 function takes a conjecture, preprocesses the conjecture, and calls a non-ACL2 program to search for a proof or countermodel. If the non-ACL2 program succeeds, ACL2 functions check the proof or countermodel. The top ACL2 function is proved sound with respect to finite interpretations. Introduction Our ACL2 project arose from a different kind of automated theorem proving. We work with fully automatic resolution/paramodulation theo- This work was supported by the Mathematical, Information, and Computational Sciences Division subprogram...	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	6 found	ParsCit 1.0