Monotonic and dual monotonic language learning from positive as well as from positive and negative examples is investigated. Three different notions of monotonicity are considered. Each of them reflects an alternative formalization of the requirement that the learner has to produce better and better generalizations when fed more and more data on the concept to be learned. Strong-monotonicity absolutely requires that only better and better generalizations be produced. Monotonic learning reflects the demand that for any two guesses the one output later has to be, with respect to the target language, at least as good as the earlier one. Weak--monotonicity is the analogue in learning theory of cumulativity . The corresponding three versions of...
We study the learnability of indexed families of uniformly recursive languages under certain monoton...
Proc. ALT\u2790, 339-354; New Generation Computing 8, 371-384, 1991A formal system is a finite set o...
We study the learnability of indexed families L = (L j ) j2IN of uniformly recursive languages under...
AbstractMonotonic and dual monotonic language learning from positive as well as from positive and ne...
In the present paper strong-monotonic, monotonic and weak-monotonic reasoning is studied in the cont...
AbstractThe present paper deals with monotonic and dual monotonic language learning from positive as...
The present paper deals with monotonic and dual monotonic language learning from positive and negati...
The present paper deals with the learnability of indexed families $ mathcal{L} $ of uniformly recurs...
We present a systematic method for incorporating prior knowledge (hints) into the learning-from-exam...
textabstractThe monotonicity property is ubiquitous in our lives and it appears in different roles: ...
Monotonicity-based inference is a fundamental notion in the logical semantics of natural language, a...
AbstractThe paper explores language learning in the limit under various constraints on the number of...
This paper serves two purposes. It is a summary of much work con-cerning formal treatments of monoto...
This paper addresses methods of specialising first-order theories within the context of incremental ...
This thesis focuses on the Gold model of inductive inference from positive data. There are several ...
We study the learnability of indexed families of uniformly recursive languages under certain monoton...
Proc. ALT\u2790, 339-354; New Generation Computing 8, 371-384, 1991A formal system is a finite set o...
We study the learnability of indexed families L = (L j ) j2IN of uniformly recursive languages under...
AbstractMonotonic and dual monotonic language learning from positive as well as from positive and ne...
In the present paper strong-monotonic, monotonic and weak-monotonic reasoning is studied in the cont...
AbstractThe present paper deals with monotonic and dual monotonic language learning from positive as...
The present paper deals with monotonic and dual monotonic language learning from positive and negati...
The present paper deals with the learnability of indexed families $ mathcal{L} $ of uniformly recurs...
We present a systematic method for incorporating prior knowledge (hints) into the learning-from-exam...
textabstractThe monotonicity property is ubiquitous in our lives and it appears in different roles: ...
Monotonicity-based inference is a fundamental notion in the logical semantics of natural language, a...
AbstractThe paper explores language learning in the limit under various constraints on the number of...
This paper serves two purposes. It is a summary of much work con-cerning formal treatments of monoto...
This paper addresses methods of specialising first-order theories within the context of incremental ...
This thesis focuses on the Gold model of inductive inference from positive data. There are several ...
We study the learnability of indexed families of uniformly recursive languages under certain monoton...
Proc. ALT\u2790, 339-354; New Generation Computing 8, 371-384, 1991A formal system is a finite set o...
We study the learnability of indexed families L = (L j ) j2IN of uniformly recursive languages under...