Experiments with the ALPOC theorem prover
| dc.contributor.author | Spencer, Bruce | |
| dc.contributor.author | Horton, J., D. | |
| dc.contributor.author | Francis, Kelsey | |
| dc.date.accessioned | 2023-03-02T23:44:22Z | |
| dc.date.available | 2023-03-02T23:44:22Z | |
| dc.date.issued | 1995 | |
| dc.description.abstract | A system for selecting and preparing a batch of data files, and running a selected computer program with each data file is described. Another facility collects the experimental results from several different batches and summarizes the results in a tabular form. A theorem prover, ALPOC, is implemented that combines Shostak's C-literal resolution steps with Stickel's PTTP compiler, and uses Spencer's Ordered Clause set restriction. A series of experiments is run that compares ALPOC with PTTP, using the batch system. The results are summarized and compared with Stickel's PTTP implemented in Prolog. The results show that ALPOC is slower than PTTP by a factor of at most 4, but frequently is much faster. On the problems where ALPOC is faster the number of extension steps in the ALPOC proof is less than the PTTP proof, which leads the iterative deepening search method to explore fewer levels. | |
| dc.description.copyright | Copyright @ B. Spencer, J. D. Horton, and K. Francis, 1995. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/22409 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Experiments with the ALPOC theorem prover | |
| dc.type | journal article |
Files
Original bundle
1 - 1 of 1