The HR program for theorem generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2392, Issue , 2002, Pages 285-289

  Colton, Simon ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948974453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_24     Document Type: Conference Paper

References (11)

1. S Colton. Automated Theory Formation in Pure Mathematics. PhD thesis, Department of Artificial Intelligence, University of Edinburgh, 2000.
2. S Colton, A Bundy, and T Walsh. Automatic identification of mathematical concepts. In Machine Learning: Proceedings of the 17th International Conference, 2000.
3. S Colton, A Bundy, and T Walsh. On the notion of interestingness in automated mathematical discovery. IJHCS, 53(3):351–375, 2000.
4. S. Colton and I Miguel. Constraint generation via automated theory formation. In Proceedings of CP-01, 2001.
5. S Colton and G Sutcliffe. Automatic Generation of Benchmark Problems for ATP Systems. In Proceedings of the 7th Symposium on AI and Mathematics, 2002.
6. Andreas Franke and Michael Kohlhase. Mathweb, an agent-based communication layer for distributed automated theorem proving. In CADE 16, 1999.
7. P Jackson. Computing prime implicates incrementally. In CADE 11, 1992.
8. W McCune. The OTTER user’s guide. Technical Report ANL/90/9, Argonne National Laboratories, 1990.
9. W McCune. A Davis-Putnam program and its application to finite first-order model search. Technical Report ANL/MCS-TM-194, Argonne National Laboratories, 1994.
10. G Sutcliffe and C Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177–203, 1998. www.cs.miami.edu/˜tptp/.
11. J Zhang. MCS: Model-based conjecture searching. In CADE-16, 1999.