62 search results - page 1 / 13 » Learnability of Term Rewrite Systems from Positive Examples |
CATS
2006
13 years 6 months ago
2006
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 rewri...
ENTCS
2007
13 years 4 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
RTA
1991
Springer
13 years 8 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
EUROCOLT
1999
Springer
13 years 9 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...