Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CATS
2006

favoriteEmaildiscussreport

87views Applied Computing» more CATS 2006»

Learnability of Term Rewrite Systems from Positive Examples

13 years 5 months ago

Learnability of Term Rewrite Systems from Positive Examples

Download crpit.com

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.

M. R. K. Krishna Rao

Real-time Traffic

CATS 2006 | CATS 2007 | Linear-bounded Term | Positive Examples | Term Rewriting Systems |

claim paper

Related Content

» Inducing Constructor Systems from ExampleTerms by Detecting Syntactical Regularities

» Narrowing Directed by a Graph of Terms

» Term Rewriting Meets AspectOriented Programming

» Mind Change Complexity of Learning Logic Programs

» Automated design of scoring rules by learning from examples

» Loop detection in term rewriting using the eliminating unfoldings

» The sizechange principle and dependency pairs for termination of term rewriting

» Coloured stochastic multilevel multiset rewriting

» On a Generalized Notion of Mistake Bounds

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CATS
Authors	M. R. K. Krishna Rao

Comments (0)