## Learning Elementary Formal Systems with Queries (2000)

### Cached

### Download Links

- [ftp.i.kyushu-u.ac.jp]
- [www.i.kyushu-u.ac.jp]
- DBLP

### Other Repositories/Bibliography

Citations: | 4 - 3 self |

### BibTeX

@TECHREPORT{Sakamoto00learningelementary,

author = {Hiroshi Sakamoto and Kouichi Hirata and Hiroki Arimura},

title = {Learning Elementary Formal Systems with Queries},

institution = {},

year = {2000}

}

### OpenURL

### Abstract

An elementary formal system (EFS , for short) is a kind of logic program which directly manipulates character strings. A number of researches have investigated the ability of EFS as an uniform framework for language learning in various learning models including model inference, inductive inference, and PAC-learning. In this paper, we investigate the polynomial time learnability of EFS from the view of active learning allowing membership queries. Positive results include the polynomial time learnability of the class of terminating HEFS of variable-occurrence k and arity r from equivalence queries and entailment membership queries with the information on termination. We also presented a lower bound result showing that the algorithm is near optimal in the query complexity. Negative results include a series of representation-independent hardness results, which fill the gap between the learnable and the non-learnable subclasses of EFS in our knowledge. Particularly, we showed th...