3. CTRS 1992: Pont-à-Mousson, France

@proceedings{DBLP:conf/ctrs/1992,
  editor    = {Micha{\"e}l Rusinowitch and
               Jean-Luc Remy},
  title     = {Conditional Term Rewriting Systems, Third International Workshop,
               CTRS-92, Pont-{\`a}-Mousson, France, July 8-10, 1992, Proceedings},
  booktitle = {CTRS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {656},
  year      = {1993},
  isbn      = {3-540-56393-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Typed Systems and Graph Rewriting

• Karl Meinke: Algebraic Semantics of Rewriting Terms and Types. 1-20 BibTeX
• Stefan Kahrs: Context Rewriting. 21-35 BibTeX
• Kristoffer Høgsbro Rose: Explicit Cyclic Substitutions. 36-50 BibTeX

Modularity and Termination

• Richard Banach: Simple Type Inference for Term Graph Rewriting Systems. 51-66 BibTeX
• Valentin M. Antimirov, Anatoli Degtyarev: Consistency and Semantics of Equational Definitions over Predefined Algebras. 67-81 BibTeX
• Aart Middeldorp: Completeness of Combinations of Conditional Constructor Systems. 82-96 BibTeX
• Detlef Plump: Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. 97-112 BibTeX
• Enno Ohlebusch: Combinations of Simplifying Conditional Term Rewriting Systems. 113-127 BibTeX
• Bernhard Gramlich: Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. 128-142 BibTeX
• Carlos Loría-Sáenz, Joachim Steinbach: Termination of Combined (Rewrite and lambda-Calculus) Systems. 143-147 BibTeX
• Hans Zantema: Type Removal in Term Rewriting. 148-154 BibTeX
• Hans Zantema: Termination of Term Rewriting by Interpretation. 155-167 BibTeX
• Nachum Dershowitz, Subrata Mitra: Path Orderings for Termination of Associative-Commutative Rewriting. 168-174 BibTeX

Proof Techniques and Extensions of Conditional Rewriting

• Peter Padawitz: Generic Induction Proofs. 175-197 BibTeX
• Claus-Peter Wirth, Bernhard Gramlich: A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. 198-212 BibTeX
• Klaus Becker: Semantics for Positive/Negative Conditional Rewrite Systems. 213-225 BibTeX
• Harald Ganzinger, Jürgen Stuber: Inductive Theorem Proving by Consistency for First-Order Clauses. 226-241 BibTeX
• François Bronsard, Uday S. Reddy: Reduction Techniques for First-Order Reasoning. 242-256 BibTeX

Theorem-Proving and Normal Form Languages

• David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee: Conditional Term Rewriting and First-Order Theorem Proving. 257-271 BibTeX
• Gregory Kucherov, Mohamed Tajine: Decidability of Regularity and Related Properties of Ground Normal Form Languages. 272-286 BibTeX
• Dieter Hofbauer, Maria Huber: Computing Linearizations Using Test Sets. 287-301 BibTeX

Applications of Conditional Rewriting and New Formalisms

• Hantao Zhang: Proving Group Isomorphism Theorems (Extended Abstract). 302-306 BibTeX
• Nachum Dershowitz: Semigroups Satisfying x^m+n = xⁿ. 307-314 BibTeX
• Sergei G. Vorobyov: Could Orders Be Captured By Term Rewriting Systems? 315-327 BibTeX
• Karel Stokkermans: A Categorical Formulation for Critical-Pair/Completion Procedures. 328-342 BibTeX
• Yabo Wang, David Lorge Parnas: Trace Rewriting Systems. 343-356 BibTeX
• Ulrich Fraus: A Calculus for Conditional Inductive Theorem Proving. 357-362 BibTeX

Contextual Rewriting and Constrained Rewriting

• Hantao Zhang: Implementing Contextual Rewriting. 363-377 BibTeX
• Junnosuke Yamada: Confluence of Terminating Membership Conditional TRS. 378-392 BibTeX
• Lars With: Completeness and Confluence of Order-Sorted Term Rewriting. 393-407 BibTeX
• Charles Hoot: Completion for Constrained Term Rewriting Systems. 408-423 BibTeX
• Akihiko Takano: Generalized Partial Computation using Disunification to Solve Constraints. 424-428 BibTeX

Aplications to Logic Programming, Normalization Strategies and Unification

• Leszek Pacholski: Decidability of finiteness properties (Abstract). 429 BibTeX
• Harald Ganzinger, Uwe Waldmann: Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems. 430-437 BibTeX
• Staffan Bonnier, Jonas Wallgren: Logic Programs with Polymorphic Types: A condition for static type checking. 438-447 BibTeX
• Sergio Antoy: Normalization by Leftmost Innermost Rewriting. 448-457 BibTeX
• Paola Inverardi, Monica Nesi: A Strategy to Deal with Divergent Rewrite Systems. 458-467 BibTeX
• Bertrand Delsart: A New Approach to General E-Unification Based on Conditional Rewriting Systems. 468-482 BibTeX
• Alexander Bockmayr, Stefan Krischer, Andreas Werner: An Optimal Narrowing Strategy for General Canonical Systems. 483-497 BibTeX
• Wenchang Fang, Jung-Hong Kao: Set-Of-Support Strategy for Higher-Order Logic. 498-501 BibTeX