The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jan Willem Klop
    Origin Tracking in Term Rewriting (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:1- [Conf]
  2. Satoshi Okui
    Simultaneous Critical Pairs and Church-Rosser Property. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:2-16 [Conf]
  3. Enno Ohlebusch
    Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:17-31 [Conf]
  4. Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
    Automatic Monoids Versus Monoids with Finite Convergent Presentations. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:32-46 [Conf]
  5. Jordi Levy
    Decidable and Undecidable Second-Order Unification Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:47-60 [Conf]
  6. Manfred Schmidt-Schauß, Klaus U. Schulz
    On the Exponent of Periodicity of Minimal Solutions of Context Equation. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:61-75 [Conf]
  7. Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
    Unification in Extension of Shallow Equational Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:76-90 [Conf]
  8. Qing Guo, Paliath Narendran, Sandeep K. Shukla
    Unification and Matching in Process Algebras. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:91-105 [Conf]
  9. Renate A. Schmidt
    E-Unification for Subsystems of S4. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:106-120 [Conf]
  10. Sébastien Limet, Pierre Réty
    Solving Disequations Modulo Some Class of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:121-135 [Conf]
  11. Hubert Comon
    About Proofs by Consistency (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:136-137 [Conf]
  12. Johannes Waldmann
    Normalization of S-Terms is Decidable. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:138-150 [Conf]
  13. Thomas Genet
    Decidable Approximations of Sets of Descendants and Sets of Normal Forms. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:151-165 [Conf]
  14. Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
    Algorithms and Reductions for Rewriting Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:166-180 [Conf]
  15. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
    The Decidability of Simultaneous Rigid E-Unification with One Variable. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:181-195 [Conf]
  16. Martin Müller, Joachim Niehren
    Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:196-210 [Conf]
  17. Witold Charatonik, Andreas Podelski
    Co-definite Set Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:211-225 [Conf]
  18. Thomas Arts, Jürgen Giesl
    Modularity of Termination Using Dependency pairs. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:226-240 [Conf]
  19. Claude Marché, Xavier Urbain
    Termination of Associative-Commutative Rewriting by Dependency Pairs. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:241-255 [Conf]
  20. Takahito Aoto, Yoshihito Toyama
    Termination Transformation by Tree Lifting Ordering. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:256-270 [Conf]
  21. Hongwei Xi
    Towards Automated Termination Proofs through "Freezing". [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:271-285 [Conf]
  22. Olivier Danvy, Kristoffer Høgsbro Rose
    Higher-Order Rewriting and Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:286-301 [Conf]
  23. Yohji Akama
    SN Combinators and Partial Combinatory Algebras. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:302-316 [Conf]
  24. Dirk Fuchs
    Coupling Saturation-Based Provers by Exchanging Positive/Negative Information. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:317-331 [Conf]
  25. Nachum Dershowitz, Ralf Treinen
    An On-line Problem Database. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:332-342 [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