Sciweavers

77 search results - page 1 / 16
» Presenting a Category Modulo a Rewriting System
Sort
View
RTA
1987
Springer
13 years 7 months ago
Completion for Rewriting Modulo a Congruence
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
Leo Bachmair, Nachum Dershowitz
RTA
2010
Springer
13 years 7 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
IANDC
2010
141views more  IANDC 2010»
13 years 2 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
ENTCS
2010
103views more  ENTCS 2010»
13 years 1 months ago
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
Olaf Owe, Martin Steffen, Arild B. Torjusen
RTA
1993
Springer
13 years 7 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
Jordi Levy, Jaume Agustí-Cullell