Paper Info
Title
Well-Behaved Search and the Robbins Problem
Abstract
IntroductionThe Robbins problem was solved in October 1996 [7] by the equational theoremprover EQP [6]. Although the solution was automatic in the sense that the userof the program did not know a solution, it was not a simple matter of giving theconjecture and pushing a button. The user made many computer runs, observedthe output, adjusted the search parameters, and made more computer runs. Thegoal of this kind of iteration is to achieve a well-behaved search. Several of thesearches...
Year
DOI
Venue
1997
10.1007/3-540-62950-5_57
RTA
Keywords
Field
DocType
robbins problem,well-behaved search
Discrete mathematics,Robbins' problem,Computer science,Automated theorem proving,Conjecture,Calculus
Conference
Volume
ISSN
ISBN
1232
0302-9743
3-540-62950-5
Citations 
PageRank 
References 
2
0.39
6
Authors
1
Name
Order
Citations
PageRank
William McCune112327.86