Automated reasoning using stochastic search

Chilukuri K. Mohan, Scott M. Huse

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish (US)
Pages843-848
Number of pages6
StatePublished - Dec 1 1993
EventProceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93 - St.Louis, MO, USA
Duration: Nov 14 1993Nov 17 1993

Other

OtherProceedings of the 1993 Artificial Neural Networks in Engineering, ANNIE'93
CitySt.Louis, MO, USA
Period11/14/9311/17/93

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Automated reasoning using stochastic search'. Together they form a unique fingerprint.

Cite this