KFUPM ePrints

On "learning term rewriting systems from entailment"

Rao, M.R.K. (2003) On "learning term rewriting systems from entailment". Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International conference, 1.

[img]
Preview
PDF
18Kb
[img]Microsoft Word
26Kb

Abstract

Summary form only given. We study exact learning of term rewriting systems from entailment and refute a recent result by Arimura, Sakamoto and Arikawa about polynomial time learnability of k-variable linear tree translations (LTT (k)). It was incorrectly claimed that the length of derivations of LTT (k) is bounded by a polynomial in the size of the initial term. This claim led to their result on polynomial time learnability of LTT (k). We present a simple system in the class of 1-variable linear tree translations that has a derivation of exponential length. We also discuss why it is difficult to syntactically separate the rewriting systems defining polynomial functions and the rewriting systems defining exponential functions. We then identify a few requirements for polynomial time learnability of rewriting systems and discuss how these requirements may be achieved.



Item Type:Article
Date:July 2003
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Information and Computer Science Dept
Creators:Rao, M.R.K.
ID Code:14218
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:27
Last Modified:12 Apr 2011 13:14

Repository Staff Only: item control page