The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. William McCune
    Well-Behaved Search and the Robbins Problem. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:1-7 [Conf]
  2. Christopher Lynch
    Goal-Directed Completion Using SOUR Graphs. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:8-22 [Conf]
  3. Deepak Kapur
    Shostak's Congruence Closure as Completion. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:23-37 [Conf]
  4. Ulrich Kühler, Claus-Peter Wirth
    Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:38-52 [Conf]
  5. Friedrich Otto, Masashi Katsura, Yuji Kobayashi
    Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:53-67 [Conf]
  6. Andrea Sattler-Klein
    New Undecidablility Results for Finitely Presented Monoids. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:68-82 [Conf]
  7. Friedrich Otto
    On the Property of Preserving Regularity for String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:83-97 [Conf]
  8. Evelyne Contejean, Claude Marché, Landy Rabehasaina
    Rewrite Systems for Natural, Integral, and Rational Arithmetic. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:98-112 [Conf]
  9. Leo Bachmair, Ashish Tiwari
    D-Bases for Polynomial Ideals over Commutative Noetherian Rings. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:113-127 [Conf]
  10. Georg Struth
    On the Word Problem for Free Lattices. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:128-141 [Conf]
  11. Deepak Kapur, G. Sivakumar
    A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:142-156 [Conf]
  12. Thomas Arts, Jürgen Giesl
    Proving Innermost Normalisation Automatically. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:157-171 [Conf]
  13. Hans Zantema
    Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:172-186 [Conf]
  14. Michio Oyamaguchi, Yoshikatsu Ohta
    A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:187-201 [Conf]
  15. Nachum Dershowitz
    Innocuous Constructor-Sharing Combinations. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:202-216 [Conf]
  16. Samuel M. H. W. Perlo-Freeman, Péter Pröhle
    Scott's Conjecture is True, Position Sensitive Weights. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:217-227 [Conf]
  17. Yves Lafont
    Two-Dimensional Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:228-229 [Conf]
  18. Denis Bechet, Philippe de Groote, Christian Retoré
    A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:230-240 [Conf]
  19. Jerzy Marcinkowski
    Undecidability of the First Order Theory of One-Step Right Ground Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:241-253 [Conf]
  20. Sergei G. Vorobyov
    The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:254-268 [Conf]
  21. Ana Paula Tomás, Miguel Filgueiras
    Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:269-283 [Conf]
  22. Klaus U. Schulz
    A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:284-298 [Conf]
  23. Richard Statman
    Effective Reduction and Conversion Strategies for Combinators. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:299-307 [Conf]
  24. Vincent van Oostrom
    Finite Family Developments. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:308-322 [Conf]
  25. Christophe Ringeissen
    Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:323-326 [Conf]
  26. Manfred Göbel
    The Invariant Package of MAS. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:327-330 [Conf]
  27. Edward L. Green, Lenwood S. Heath, Benjamin J. Keller
    Opal: A System for Computing Noncommutative Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:331-334 [Conf]
  28. Kazuhiro Ogata, Koichi Ohhara, Kokichi Futatsugi
    TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:335-338 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002