Mind change complexity of learning logic programs
Jain, Sanjay & Sharma, Arun (2002) Mind change complexity of learning logic programs. Theoretical Computer Science, 284(1), pp. 143-160.
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts.
Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural
number m >0, the class of languages defined by formal systems of length <= m:
• is identifiable in the limit from positive data with a mind change bound of Omega (power)m;
• is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m.
The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs,
and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Inductive inference, Computational learning theory, Mind change complexity, Logic programs|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTATION THEORY AND MATHEMATICS (080200)|
|Divisions:||Current > QUT Faculties and Divisions > Division of Research and Commercialisation|
|Deposited On:||27 Sep 2010 11:51|
|Last Modified:||11 Aug 2011 00:54|
Repository Staff Only: item control page