We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
This paper presents a compact analog neuron cell incorporating an array of charge-coupled synapses connected via a common output terminal. The novel silicon synapse is based on a t...
Yajie Chen, Steve Hall, Liam McDaid, Octavian Buiu...
Abstract--Compress-and-Forward is a protocol for transmission over relay networks in which the relay forwards a compressed version of the signal it observes. The compression method...
Harold H. Sneessens, Luc Vandendorpe, J. Nicholas ...
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...