Learning algebraic structures from text

Theoretical Computer Science

Volumn 268, Issue 2, 2001, Pages 221-273

  Stephan, Frank ^a   Ventsov, Yuri ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Algebraic structures; Artinian rings; Ideals; Inductive inference; Noetherian rings; Recursion theory; Synthesis of learners

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; EQUIVALENCE CLASSES; FINITE DIFFERENCE METHOD; KNOWLEDGE BASED SYSTEMS; POLYNOMIAL APPROXIMATION; SEMANTICS; VECTORS;

LEARNING ALGEBRAIC STRUCTURES;

LEARNING SYSTEMS;

EID: 0035904594     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00272-3     Document Type: Conference Paper

References (47)

1. Inductive inference and unsolvability
2. Ordinal mind change complexity of language identification
3. Inductive inference of formal languages from positive data
4. Learning with higher order additional information
5. Synthesizing enumeration techniques for language learning
6. Prediction and limiting synthesis of recursively enumerable classes of functions
7. Rekursive algebren mit kettenbedingungen
8. Toward a mathematical theory of inductive inference
9. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
10. Synthesizing learners tolerating computable noisy data
11. Inductive inference and language identification
12. Comparison of identification criteria for machine inductive inference
13. Decidability at the theory of one function, Abstract 556-37
14. On the role of procrastination for machine learning
15. Saving the phenomena, requirements that inductive inference machines not contradict known data
16. Learning via queries to an oracle
17. Language identification in the limit
18. Die frage der endlich vielen schritte in der theorie der polynomideale
19. Complete theories of unars
20. Automatic synthesis of programs and inductive inference of functions
21. On uniform learnability of language families
22. Logical programming without equality and constructive representations
23. Robust learning with infinite additional information
24. Algorithmic degree of unars
25. On approximately identifying concept classes in the limit
26. Identifiability of subspaces and homomorphic images of zero-reversible languages
27. Minimal models of theories of one function symbol
28. The number of countable models of a theory of one unary function
29. Recursive digraphs, splinters and cylinders
30. Idealtheorie in Ringbereichen
31. Synthesizing inductive expertise
32. Remark on partially ordered sets, universal algebras and semigroups
33. Generalized notions of mind change complexity
34. Three decades of team learning
35. Noisy inference and oracles
36. The complexity of universal textlearners
37. Splinters of recursive functions
38. A guided tour across the boundaries of learning recursive languages