Disclosed is magnetic character reader which records an ac signal on discontinuous portions of magnetic material and detects the prerecorded signal as a function of character width to decode the… Expand

An order-sorted approach is used to suitably assign semantics to equational specifications in a denotational as well as an operational way, which enables the operationalization to generalize some basic results from classical rewrite theory.Expand

A general framework for studying equational specifications with pre-defined structures is presented and a semantically enriched notion of term rewriting is introduced in order to enable functional-style computations.Expand

This work proposes to develop soundness proofs systematically by presenting an abstract frame inference system a priori and then to design each concrete inference rule locally as a sub-rule of some frame inference rule and to show its soundness by a small local proof establishing this sub- rule relationship.Expand

This work presents a refutationally complete prover for ground confluence and inductive validity that applies to unstructured as well as constructor based equational specifications and shows that the proof-by-consistency concepts not only apply to inductive theorem proving, but can as well be employed to proveGround confluence of rewrite systems.Expand

Two approaches to define the semantics for positive/negative conditional rewrite systems are presented and a well-founded ordering and a set of predefined inequations leads to an initial model semantics provided the inequations are interpreted in a non-standard way.Expand

We show how to prove ground confluence of term rewrite relations that areinduced by reductive systems of clausal rewrite rules. According to a well-knowncritical pair criterion it suffices for such… Expand

Previous work on combination techniques considered the question of how to combine unification algorithms for disjoint equational theories E1, . . . , En in order to obtain a unification algorithm for… Expand

We show how to prove ground connuence of term rewrite relations that are induced by reductive systems of clausal rewrite rules. According to a well-known critical pair criterion it suuces for such… Expand