Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Embedding complex decision procedures inside an interactive theorem prover

Embedding complex decision procedures inside an interactive theorem prover As is well known, it is important to enrich the basic deductive machinery of an interactive theorem prover with complex decision procedures. Previous work pointed out that one of the most difficult problems is the integration of these decision procedures with the rest of the system. In particular, they should be flexible enough to be effectively usable when building new proof strategies. This paper describes a hierarchical and modular structure of procedures which can be either invoked individually or jointly with the others. To each combination of procedures, there corresponds a proof strategy particularly effective for a given class of formulae. Moreover, the functionalities provided by the procedures can be exploited in an effective way by user-defined proof strategies, whose design and mechanization are therefore greatly simplified. The implementation of the procedures is described and the problems faced in embedding them inside the GETFOL system are discussed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Embedding complex decision procedures inside an interactive theorem prover

Download PDF
28 pages

Loading next page...
 
/lp/springer-journals/embedding-complex-decision-procedures-inside-an-interactive-theorem-GOltlR0dIW

References (37)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/BF01530803
Publisher site
See Article on Publisher Site

Abstract

As is well known, it is important to enrich the basic deductive machinery of an interactive theorem prover with complex decision procedures. Previous work pointed out that one of the most difficult problems is the integration of these decision procedures with the rest of the system. In particular, they should be flexible enough to be effectively usable when building new proof strategies. This paper describes a hierarchical and modular structure of procedures which can be either invoked individually or jointly with the others. To each combination of procedures, there corresponds a proof strategy particularly effective for a given class of formulae. Moreover, the functionalities provided by the procedures can be exploited in an effective way by user-defined proof strategies, whose design and mechanization are therefore greatly simplified. The implementation of the procedures is described and the problems faced in embedding them inside the GETFOL system are discussed.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Apr 5, 2005

There are no references for this article.