Abstract
Inductive inference from positive data is shown to be remarkably powerful using the framework of elementary formal systems. An elementary formal system, EFS for short, is a kind of logic program on Σ+ consisting of finitely many axioms. Any context-sensitive language is definable by a restricted EFS, called a length-bounded EFS. Length-bounded EFSs with at most n axioms are considered, and it is shown that inductive inference from positive data works successfully for their models as well as for their languages. From this it follows that any class of logic programs, such as Prolog programs, corresponding to length-bounded EFSs can be inferred from positive facts.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
