A. Bundy, S. Colton, and T. Walsh, HR: A System for Machine Discovery in Finite Algebras, in: H. Prade, ed., ECAI 98 Brighton : 13th European Conference on Arti cial Intelligence, Brighton (Wiley, New York, 1998). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Theory Formation in Graph Theory - Pistori, Wainer (1999) (3 citations) (Correct)
....Instituto de Computacao, Universidade Estadual de Campinas, Campinas, SP, Brasil wainer dcc.unicamp.br Abstract. This paper presents SCOT, a system for automatic theory construction in the domain of Graph Theory. Following on the footsteps of the programs ARE [9] HR [1] and Cyrano [6] concept discovery is modeled as search in a concept space. We propose a classification for discovery heuristics, which takes into account the main processes related to theory construction: concept construction, example production, example analysis, conjecture construction, and ....
....Graph Properties and Graph Classes, SCOT treats uniformly both graph and other graph components. Thus SCOT can define concepts like cut vertex, which could not be discovered as such in GT because it is neither a Graph, nor a Graph Property (it s a vertex property) Haase [6] Shen [9] and Bundy [1], propose a concept representation mechanism that is very similar to the one SCOT uses. It is, basically, a set of operators employed to create new concepts from old concepts, and a set of heuristics that determines the concepts and the operators to be used at each step. Given an initial set of ....
[Article contains additional citation context not shown here]
S. Colton A. Bundy and T. Walsh. HR - a system for machine discovery in finite algebras. ECAI 98 Workshop Programme, 1998.
Intelligent Machinery and Mathematical Discovery - Larson (1999) (3 citations) (Correct)
....The last program accounted for in this survey the most recent to appear is HR (for Hardy Ramanujan ) a program which does advance new mathemati11 cal propositions. It was created by researchers, headed by Simon Colton, at the University of Edinburgh and their research is still in progress. [4, 5, 7] They describe their program as follows: The HR program forms concepts and makes conjectures in domains of pure mathematics and uses theorem prover OTTER and model generator MACE to prove or disprove the conjectures. 4] The HR team is extremely ambitious and the automation of ....
....They also represent the three types of new propositions HR has produced. 1. For groups G and G 0 up to order 6, G and G 0 are isomorphic if and only if f(G) f(G 0 ) where the function f is de ned as follows: for any group G, f(G) jf(a; b; c) 2 G 3 : a b = c and b c = agj [5] 2. No perfect number is refactorable. 7] 3. The refactorable numbers are a subsequence of the sequence of positive integers congruent to 0, 1, 2, or 4 (mod 8) 7] Do these propositions contribute to the advancement of mathematics That is, are they (research) conjectures Could they aid in ....
A. Bundy, S. Colton, and T. Walsh, HR: A System for Machine Discovery in Finite Algebras, in: Proceedings of the Machine Discovery Workshop ECAI99 , Brighton (1998) to appear.
On Progress in the Automation of Mathematical Conjecture-Making - Larson (2001) (Correct)
No context found.
A. Bundy, S. Colton, and T. Walsh, HR: A System for Machine Discovery in Finite Algebras, in: H. Prade, ed., ECAI 98 Brighton : 13th European Conference on Arti cial Intelligence, Brighton (Wiley, New York, 1998).
An Updated Survey of Research in Automated Mathematical.. - Larson (Correct)
No context found.
A. Bundy, S. Colton, and T. Walsh, HR: A System for Machine Discovery in Finite Algebras, in: Proceedings of the Machine Discovery Workshop, Brighton (1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC