584 search results - page 6 / 117 » Logic Programs as term Rewriting Systems |
114
click to vote
MCMASTER
1993
15 years 1 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
110
Voted
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
88
Voted
CATS
2006
14 years 11 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...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
153
click to vote
RTA
2011
Springer
14 years 12 days ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...