1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99419
DC FieldValue
dc.titleStrong monotonic and set-driven inductive inference
dc.contributor.authorJain, S.
dc.date.accessioned2014-10-27T06:03:57Z
dc.date.available2014-10-27T06:03:57Z
dc.date.issued1997-01
dc.identifier.citationJain, S. (1997-01). Strong monotonic and set-driven inductive inference. Journal of Experimental and Theoretical Artificial Intelligence 9 (1) : 137-143. ScholarBank@NUS Repository.
dc.identifier.issn0952813X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99419
dc.description.abstractIn 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.
dc.sourceScopus
dc.subjectInductive inference
dc.subjectSet-driven
dc.subjectStrong monotonicity
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleJournal of Experimental and Theoretical Artificial Intelligence
dc.description.volume9
dc.description.issue1
dc.description.page137-143
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.