Refinements to depth-first iterative-deepening search in automatic theorem proving
✍ Scribed by Xumin Nie; David A. Plaisted
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 639 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
✦ Synopsis
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 tterattvedeepenmg search by the refinement Some complexity results about the priority system are also given The second refinement ts based on a syntactic vtewpomt of proof development, which views the process of findmg proofs as an mcremental process of construcung mstances with a certain property We quantify thzs process to control the depth-first tteratlve-deepenmg search. Both refinements have been implemented zn a sequent-style back chammg theorem prover and tested on a large number of problems and have been shown to be effectwe