62 search results - page 3 / 13 » Learnability of Term Rewrite Systems from Positive Examples |
EUROCOLT
1999
Springer
13 years 10 months ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
RTA
2010
Springer
13 years 10 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
CTRS
1987
13 years 9 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
FROCOS
2005
Springer
13 years 12 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...