Machine Theorem Discovery

In this article,  I propose a framework for machine theorem discovery and illustrate its use in discovering state invariants in planning domains and properties about Nash equilibria in game theory. I also discuss its potential use in program verification in software engineering. The main message of the article is that many AI problems can and should be formulated as machine theorem discovery tasks.