In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Abstract. The Spectrum project concentrates on the process of developing well-structured, precise system speci cations. Spectrum is a speci cation language, with a deduction calcul...
The feasibility of extracting both explicit and implicit synonym references from a machine readable dictionary is investigated; the extracted synonyms, both symmetric and asymmetr...
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...