Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Inductive inference of minimal programs
COLT '90 Proceedings of the third annual workshop on Computational learning theory
A universal inductive inference machine
Journal of Symbolic Logic
A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Learning Formulae from Elementary Facts
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
Inductive Inference of Recursive Functions: Complexity Bounds
Baltic Computer Science, Selected Papers
| Hi-index | 0.00 |
We study learning of predicate logics formulas from ''elementary facts,'' i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is ''practically'' complete. Theorems presented in the paper in some sense confirm our hypothesis.