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...
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...
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...
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...
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 ...