Abstract
Even the best theorem-prover implementations are considerably slow. Search strategies and heuristics help, but the path to the solution cannot be obtained by selecting the superficially most preferable alternative at each step. We view theorem-proving as a search problem in which a fitness function is to be optimized using a stochastic method to avoid getting stuck in local minima. Fitness functions are obtained from well-known heuristic search strategies.
| Original language | English (US) |
|---|---|
| Pages | 843-848 |
| Number of pages | 6 |
| State | Published - 1993 |
| Event | Proceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93 - St.Louis, MO, USA Duration: Nov 14 1993 → Nov 17 1993 |
Other
| Other | Proceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93 |
|---|---|
| City | St.Louis, MO, USA |
| Period | 11/14/93 → 11/17/93 |
ASJC Scopus subject areas
- Software