Learnability of term rewrite systems from positive examples

Authors:
M. R. K. Krishna Rao
Affiliations:
Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
Venue:
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Year:
2006

Citing 5
Cited 2

Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Inductive inference of monotonic formal systems from positive data

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Rewrite systems

Handbook of theoretical computer science (vol. B)
Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
Some classes of Prolog programs inferable from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory

Some classes of term rewriting systems inferable from positive data

Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewriting systems from positive examples alone. We define a class of linear-bounded term rewriting systems that are inferable from positive examples. In linear-bounded term rewriting systems, nesting of defined symbols is allowed in right-hand sides, unlike the class of flat systems considered in Krishna Rao [8]. The class of linear-bounded TRSs is rich enough to include many divide-and-conquer programs like addition, logarithm, tree-count, list-count, split, append, reverse etc.