Abstract
Experimentation strongly suggests that, for attacking deep questions and hard problems with the assistance of an automated reasoning program, the more effective paradigms rely on the retention of deduced information. A significant obstacle ordinarily presented by such a paradigm is the deduction and retention of one or more needed conclusions whose complexity sharply delays their consideration. To mitigate the severity of the cited obstacle, I formulated and feature in this article the hot list strategy. The hot list strategy asks the researcher to choose, usually from among the input statements characterizing the problem under study, one or more statements that are conjectured to play a key role for assignment completion. The chosen statements – conjectured to merit revisiting, again and again – are placed in an input list of statements, called the hot list. When an automated reasoning program has decided to retain a new conclusion C – before any other statement is chosen to initiate conclusion drawing – the presence of a nonempty hot list (with an appropriate assignment of the input parameter known as heat) causes each inference rule in use to be applied to C together with the appropriate number of members of the hot list. Members of the hot list are used to complete applications of inference rules and not to initiate applications. The use of the hot list strategy thus enables an automated reasoning program to briefly consider a newly retained conclusion whose complexity would otherwise prevent its use for perhaps many CPU-hours. To give evidence of the value of the strategy, I focus on four contexts: (1) dramatically reducing the CPU time required to reach a desired goal, (2) finding a proof of a theorem that had previously resisted all but the more inventive automated attempts, (3) discovering a proof that is more elegant than previously known, and (4) answering a question that had steadfastly eluded researchers relying on an automated reasoning program. I also discuss a related strategy, the dynamic hot list strategy (formulated by my colleague W. McCune), that enables the program during a run to augment the contents of the hot list. In the Appendix, I give useful input files and interesting proofs. Because of frequent requests to do so, I include challenge problems to consider, commentary on my approach to experimentation and research, and suggestions to guide one in the use of McCune’s automated reasoning program OTTER.
Similar content being viewed by others
References
Boyer, R. and Moore, J: A Computational Logic, Academic Press, New York, 1979.
Boyer, R. S. and Moore, J S.: A Computational Logic Handbook, 2nd edn, Academic Press, New York, 1998 (also Web information ftp://ftp.cs.utexas.edu/pub/boyer/nqthm/index.html).
Henkin, L., Monk, J., and Tarski, A.: Cylindric Algebras, Part I, North-Holland, Amsterdam, 1971.
Kalman, J.: A shortest single axiom for the classical equivalential calculus, Notre Dame J. Formal Logic 19 (1978), 141–144.
Kalman, J.: Condensed detachment as a rule of inference, Studia Logica 42 (1983), 443–451.
Lusk, E. and Overbeek, R.: The automated reasoning system ITP, Technical Report ANL–84–27, Argonne National Laboratory, Argonne, IL, 1984.
McCune, W.: OTTER 2.0 users guide, Technical Report ANL-90/9, Argonne National Laboratory, Argonne, IL, 1990.
McCune, W.: OTTER 3.0 reference manual and guide, Technical Report ANL-94/6, Argonne National Laboratory, Argonne, IL, 1994.
McCune, W.: Solution of the Robbins problem, J. Automated Reasoning 19(3) (1997), 263–276.
Meredith, C. A.: Single axioms for the systems (C,N), (C,0), and (A,N) of the two-valued propositional calculus, J. Computing Systems 1 (1953), 155–164.
Veroff, R. and Wos, L.: The linked inference principle, I: The formal treatment, J. Automated Reasoning 8(2) (1992), 213–274.
Winker, S.: Robbins algebra: Conditions that make a near-Boolean algebra Boolean, J. Automated Reasoning 6(4) (1990), 465–489.
Winker, S.: Absorption and idempotency criteria for a problem in near-Boolean algebras, J. Algebra 153(1) (1992), 414–423.
Wos, L., Winker, S., Veroff, R., Smith, B., and Henschen, L.: Questions concerning possible shortest single axioms in equivalential calculus: An application of automated theorem proving to infinite domains, Notre Dame J. Formal Logic 24 (1983), 205–223.
Wos, L., Winker, S., Veroff, R., Smith, B., and Henschen, L.: A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains, Artificial Intelligence 22 (1984), 303–356.
Wos, L., Veroff, R., Smith, B., and McCune, W.: The linked inference principle, II: The user' viewpoint, in R. E. Shostak (ed.), Lecture Notes in Computer Science, Vol. 170, Springer-Verlag, New York, 1984, pp. 316–332.
Wos, L.: Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, NJ: 1987.
Wos, L., Overbeek, R., Lusk, E., and Boyle, J.: Automated Reasoning: Introduction and Applications, 2nd edn, McGraw-Hill, New York, 1992.
Wos, L.: The resonance strategy, Computers and Mathematics with Applications (special issue on automated reasoning) 29(2) (1995), 133–178.
Wos, L.: Searching for circles of pure proofs, J. Automated Reasoning 15(3) (1995), 279–315.
Wos, L.: The Automation of Reasoning: An Experimenter' Notebook with OTTER Tutorial, Academic Press, New York, 1996 (see http://www.mcs.anl.gov/people/wos/index.html for input files and information on shorter proofs).
Wos, L.: OTTER and the Moufang identity problem, J. Automated Reasoning 17(2) (1996), 215–257.
Wos, L.: The power of combining resonance with heat, J. Automated Reasoning 17(2) (1996), 23–81.
Wos, L.: Automating the search for elegant proofs, J. Automated Reasoning, accepted for publication, 1997.
Wos, L.: Experiments concerning the automated search for elegant proofs, Technical Memorandum ANL/MCS-TM-221, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1997.
Wos, L.: Experiments with the hot list strategy, Technical Memorandum ANL/MCS-TM-232, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wos, L., Pieper, G.W. The Hot List Strategy. Journal of Automated Reasoning 22, 1–44 (1999). https://doi.org/10.1023/A:1005909914693
Issue Date:
DOI: https://doi.org/10.1023/A:1005909914693