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

Preview	PDF 14218_1.pdf Download (19kB) | Preview
	Microsoft Word 14218_2.doc Download (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
Subjects:	Computer
Department:	College of Computing and Mathematics > Information and Computer Science
Depositing User:	Mr. Admin Admin
Date Deposited:	24 Jun 2008 13:27
Last Modified:	01 Nov 2019 14:04
URI:	http://eprints.kfupm.edu.sa/id/eprint/14218