The SCEAS System
Navigation Menu

Conferences in DBLP

Conditional and Typed Rewriting Systems (CTRS) (ctrs)
1992 (conf/ctrs/1992)

  1. Karl Meinke
    Algebraic Semantics of Rewriting Terms and Types. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:1-20 [Conf]
  2. Stefan Kahrs
    Context Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:21-35 [Conf]
  3. Kristoffer Høgsbro Rose
    Explicit Cyclic Substitutions. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:36-50 [Conf]
  4. Richard Banach
    Simple Type Inference for Term Graph Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:51-66 [Conf]
  5. Valentin M. Antimirov, Anatoli Degtyarev
    Consistency and Semantics of Equational Definitions over Predefined Algebras. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:67-81 [Conf]
  6. Aart Middeldorp
    Completeness of Combinations of Conditional Constructor Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:82-96 [Conf]
  7. Detlef Plump
    Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:97-112 [Conf]
  8. Enno Ohlebusch
    Combinations of Simplifying Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:113-127 [Conf]
  9. Bernhard Gramlich
    Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:128-142 [Conf]
  10. Carlos Loría-Sáenz, Joachim Steinbach
    Termination of Combined (Rewrite and lambda-Calculus) Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:143-147 [Conf]
  11. Hans Zantema
    Type Removal in Term Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:148-154 [Conf]
  12. Hans Zantema
    Termination of Term Rewriting by Interpretation. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:155-167 [Conf]
  13. Nachum Dershowitz, Subrata Mitra
    Path Orderings for Termination of Associative-Commutative Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:168-174 [Conf]
  14. Peter Padawitz
    Generic Induction Proofs. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:175-197 [Conf]
  15. Claus-Peter Wirth, Bernhard Gramlich
    A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:198-212 [Conf]
  16. Klaus Becker
    Semantics for Positive/Negative Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:213-225 [Conf]
  17. Harald Ganzinger, Jürgen Stuber
    Inductive Theorem Proving by Consistency for First-Order Clauses. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:226-241 [Conf]
  18. François Bronsard, Uday S. Reddy
    Reduction Techniques for First-Order Reasoning. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:242-256 [Conf]
  19. David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee
    Conditional Term Rewriting and First-Order Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:257-271 [Conf]
  20. Gregory Kucherov, Mohamed Tajine
    Decidability of Regularity and Related Properties of Ground Normal Form Languages. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:272-286 [Conf]
  21. Dieter Hofbauer, Maria Huber
    Computing Linearizations Using Test Sets. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:287-301 [Conf]
  22. Hantao Zhang
    Proving Group Isomorphism Theorems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:302-306 [Conf]
  23. Nachum Dershowitz
    Semigroups Satisfying xm+n = xn. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:307-314 [Conf]
  24. Sergei G. Vorobyov
    Could Orders Be Captured By Term Rewriting Systems? [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:315-327 [Conf]
  25. Karel Stokkermans
    A Categorical Formulation for Critical-Pair/Completion Procedures. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:328-342 [Conf]
  26. Yabo Wang, David Lorge Parnas
    Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:343-356 [Conf]
  27. Ulrich Fraus
    A Calculus for Conditional Inductive Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:357-362 [Conf]
  28. Hantao Zhang
    Implementing Contextual Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:363-377 [Conf]
  29. Junnosuke Yamada
    Confluence of Terminating Membership Conditional TRS. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:378-392 [Conf]
  30. Lars With
    Completeness and Confluence of Order-Sorted Term Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:393-407 [Conf]
  31. Charles Hoot
    Completion for Constrained Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:408-423 [Conf]
  32. Akihiko Takano
    Generalized Partial Computation using Disunification to Solve Constraints. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:424-428 [Conf]
  33. Leszek Pacholski
    Decidability of finiteness properties (Abstract). [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:429- [Conf]
  34. Harald Ganzinger, Uwe Waldmann
    Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:430-437 [Conf]
  35. Staffan Bonnier, Jonas Wallgren
    Logic Programs with Polymorphic Types: A condition for static type checking. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:438-447 [Conf]
  36. Sergio Antoy
    Normalization by Leftmost Innermost Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:448-457 [Conf]
  37. Paola Inverardi, Monica Nesi
    A Strategy to Deal with Divergent Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:458-467 [Conf]
  38. Bertrand Delsart
    A New Approach to General E-Unification Based on Conditional Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:468-482 [Conf]
  39. Alexander Bockmayr, Stefan Krischer, Andreas Werner
    An Optimal Narrowing Strategy for General Canonical Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:483-497 [Conf]
  40. Wenchang Fang, Jung-Hong Kao
    Set-Of-Support Strategy for Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:498-501 [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