![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Logical Methods in Computer Science, Special Issue 25
Special Issue: Selected papers of the "22nd International Conference on Rewriting Techniques and Applications (RTA '11)" [RTA 2011]
- Takahito Aoto, Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. - Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
Quantifier-Free Interpolation of a Theory of Arrays. - Patrick Bahr
:
Modes of Convergence for Term Graph Rewriting. - Cynthia Kop, Femke van Raamsdonk:
Dynamic Dependency Pairs for Algebraic Functional Systems. - Naoki Nishida, Masahiko Sakai
, Toshiki Sakabe:
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. - Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar:
A Rewriting View of Simple Typing.
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.