Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Inductive inference of monotonic formal systems from positive data
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Some classes of Prolog programs inferable from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Algorithmic Program DeBugging
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
| Hi-index | 5.23 |
In this paper, we study the inferability of term rewriting systems (trss, for short) from positive examples alone. Two classes of trss inferable from positive data are presented, namely, simple flat trss and linear-bounded trss. These classes of trss are rich enough to include many divide-and-conquer programs like addition, doubling, logarithm, tree-count, list-count, split, append, reverse, etc. The classes of simple flat trss and linear-bounded trss are incomparable, i.e., there are functions that can be computed by simple flat trss but not by linear-bounded trss and vice versa.