On "learning term rewriting systems from entailment"
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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14218/1/14218_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14218/2/14218_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|