Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
1993 (conf/rta/1993)

1. Leo Bachmair
   Rewrite Techniques in Theorem Proving (Abstract). [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:1- [Conf]
   
2. Christopher Lynch, Wayne Snyder
   Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:2-16 [Conf]
   
3. Jordi Levy, Jaume Agustí-Cullell
   Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:17-31 [Conf]
   
4. Hantao Zhang
   A Case Study of Completion Modulo Distributivity and Abelian Groups. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:32-46 [Conf]
   
5. Andreas Werner
   A Semantic Approach to Order-Sorted Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:47-61 [Conf]
   
6. Jürgen Avenhaus, Jörg Denzinger
   Distributing Equational Theorem Proving. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:62-76 [Conf]
   
7. Soumen Chakrabarti, Katherine A. Yelick
   On the Correctness of a Distributed Memory Gröbner basis Algorithm. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:77-91 [Conf]
   
8. Max Moser
   Improving Transformation Systems for General E-Unification. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:92-105 [Conf]
   
9. Joachim Niehren, Andreas Podelski, Ralf Treinen
   Equational and Membership Constraints for Finite Trees. [Citation Graph (0, 0)][DBLP]
   RTA, 1993, pp:106-120 [Conf]
   
10. Rolf Backofen
    Regular Path Expression in Feature Logic. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:121-135 [Conf]
    
11. Jean H. Gallier
    Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:136- [Conf]
    
12. Daniel J. Dougherty
    Some Lambda Calculi with Categorial Sums and Products. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:137-151 [Conf]
    
13. Andrea Asperti, Cosimo Laneve
    Paths, Computations and Labels in the Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:152-167 [Conf]
    
14. Femke van Raamsdonk
    Confluence and Superdevelopments. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:168-182 [Conf]
    
15. Zena M. Ariola
    Relating Graph and Term Rewriting via Böhm Models. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:183-197 [Conf]
    
16. Nachum Dershowitz, Charles Hoot
    Topics in Termination. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:198-212 [Conf]
    
17. Maria C. F. Ferreira, Hans Zantema
    Total Termination of Term Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:213-227 [Conf]
    
18. Aart Middeldorp, Bernhard Gramlich
    Simple Termination is Difficult. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:228-242 [Conf]
    
19. Zurab Khasidashvili
    Optimal Normalization in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:243-258 [Conf]
    
20. John Field
    A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:259-273 [Conf]
    
21. Ernst Lippe
    Generating Tables for Bottom-Up Matching. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:274-288 [Conf]
    
22. Sergei I. Adian
    On some Algorithmic Problems for Groups and Monoids. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:289-300 [Conf]
    
23. Franz Baader, Klaus U. Schulz
    Combination Techniques and Decision Problems for Disunification. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:301-315 [Conf]
    
24. Mohamed Tajine
    The Negation Elimination from Syntactic Equational Formula is Decidable. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:316-327 [Conf]
    
25. Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet
    Encompassment Properties and Automata with Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:328-342 [Conf]
    
26. Jean-Claude Raoult
    Recursively Defined Tree Transductions. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:343-357 [Conf]
    
27. Maribel Fernández
    AC Complement Problems: Satisfiability and Negation Elimination. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:358-373 [Conf]
    
28. Albert Rubio, Robert Nieuwenhuis
    A Precedence-Based Total AC-Compatible Ordering. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:374-388 [Conf]
    
29. Catherine Delor, Laurence Puel
    Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:389-404 [Conf]
    
30. David A. Plaisted
    Polynomial Time Termination and Constraint Satisfaction Tests. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:405-420 [Conf]
    
31. Ursula Martin
    Linear Interpretations by Counting Patterns. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:421-433 [Conf]
    
32. Géraud Sénizergues
    Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:434- [Conf]
    
33. Pilar Nivela, Robert Nieuwenhuis
    Saturation of First-Order (Constrained) Clauses with the Saturate System. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:436-440 [Conf]
    
34. Brian Matthews
    MERILL: An Equational Reasoning System in Standard ML. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:441-445 [Conf]
    
35. Reinhard Bündgen
    Reduce the Redex -> ReDuX. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:446-450 [Conf]
    
36. Michael Löwe, Martin Beyer
    AGG - An Implementation of Algebraic Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:451-456 [Conf]
    
37. Rakesh M. Verma
    Smaran: A Congruence-Closure Based System for Equational Computations. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:457-461 [Conf]
    
38. Yexuan Gui, Mitsuhiro Okada
    LAMBDALG: Higher Order Algebraic Specification Language. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:462-466 [Conf]
    
39. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    More Problems in Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:468-487 [Conf]