Please use this identifier to cite or link to this item:
|Title:||Strong monotonic and set-driven inductive inference||Authors:||Jain, S.||Keywords:||Inductive inference
|Issue Date:||Jan-1997||Citation:||Jain, S. (1997-01). Strong monotonic and set-driven inductive inference. Journal of Experimental and Theoretical Artificial Intelligence 9 (1) : 137-143. ScholarBank@NUS Repository.||Abstract:||In an earlier paper, Kinber and Stephan posed an open problem about whether every class of languages, which can be identified strong monotonically, can also be identified by a set-driven machine. This question is solved in this paper. The answer to the question depends on whether the machines are required to be total or not! The solution of this result uncovers a finer gradation of the notion of set-drivenness.||Source Title:||Journal of Experimental and Theoretical Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/99419||ISSN:||0952813X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 12, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.