4 citations found. Retrieving documents...
G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut fur Informatik, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Modal Kleene Algebra and Applications - Survey Jules Desharnais   Self-citation (Struth)   (Correct)

No context found.

G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut fur Informatik, 1996.


Modal Kleene Algebra And Applications - A Survey - Desharnais, Möller, Struth   Self-citation (Struth)   (Correct)

No context found.

G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut fur Informatik, 1996.


Termination in Modal Kleene Algebra - Desharnais, Möller, Struth (2004)   Self-citation (Struth)   (Correct)

No context found.

G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut fur Informatik, 1996.


On the Word Problem for Free Lattices - Struth (1997)   Self-citation (Struth)   (Correct)

....for the equational theory of lattices [3,4] Rewriting techniques, however, are not limited to equations. Levy and Agust i developed a theory of bi rewriting for quasi orderings [5,6] Struth generalized equational rewriting to a theory of non symmetric rewriting for plain transitive relations [8]. Based on the example of the free semilattice, Levy and Agust i sketched some first informal steps of a non equational completion procedure and claimed that a canonical system for lattice theory is simply the sum of the dual semilattice systems. This claim is questionable for several reasons 1 ....

....the procedure terminates. Properly implemented its worst case time complexity is O(jsjjtj) but it may solve problems of non trivial length in constant time [4] 3 Non Symmetric Rewriting and the Rewrite Based Algorithm For a formal introduction to non symmetric rewriting, we refer the reader to [8]. A detailed description of the rewrite based algorithm can be found in [5] Here, we only give an informal introduction for the context of lattice theory. Given an order theoretic presentation of lattice theory and a syntactic total ordering OE on lattice terms, we investigate rewriting ....

[Article contains additional citation context not shown here]

G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, MaxPlanck -Institut fur Informatik, Saarbrucken, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC