default search action
3. CTRS 1992: Pont-à-Mousson, France
- Michaël Rusinowitch, Jean-Luc Rémy:
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 656, Springer 1993, ISBN 3-540-56393-8
Typed Systems and Graph Rewriting
- Karl Meinke:
Algebraic Semantics of Rewriting Terms and Types. 1-20 - Stefan Kahrs:
Context Rewriting. 21-35 - Kristoffer Høgsbro Rose:
Explicit Cyclic Substitutions. 36-50
Modularity and Termination
- Richard Banach:
Simple Type Inference for Term Graph Rewriting Systems. 51-66 - Valentin M. Antimirov, Anatoli Degtyarev:
Consistency and Semantics of Equational Definitions over Predefined Algebras. 67-81 - Aart Middeldorp:
Completeness of Combinations of Conditional Constructor Systems. 82-96 - Detlef Plump:
Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. 97-112 - Enno Ohlebusch:
Combinations of Simplifying Conditional Term Rewriting Systems. 113-127 - Bernhard Gramlich:
Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. 128-142 - Carlos Loría-Sáenz, Joachim Steinbach:
Termination of Combined (Rewrite and lambda-Calculus) Systems. 143-147 - Hans Zantema:
Type Removal in Term Rewriting. 148-154 - Hans Zantema:
Termination of Term Rewriting by Interpretation. 155-167 - Nachum Dershowitz, Subrata Mitra:
Path Orderings for Termination of Associative-Commutative Rewriting. 168-174
Proof Techniques and Extensions of Conditional Rewriting
- Peter Padawitz:
Generic Induction Proofs. 175-197 - Claus-Peter Wirth, Bernhard Gramlich:
A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. 198-212 - Klaus Becker:
Semantics for Positive/Negative Conditional Rewrite Systems. 213-225 - Harald Ganzinger, Jürgen Stuber:
Inductive Theorem Proving by Consistency for First-Order Clauses. 226-241 - François Bronsard, Uday S. Reddy:
Reduction Techniques for First-Order Reasoning. 242-256
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 - Gregory Kucherov, Mohamed Tajine:
Decidability of Regularity and Related Properties of Ground Normal Form Languages. 272-286 - Dieter Hofbauer, Maria Huber:
Computing Linearizations Using Test Sets. 287-301
Applications of Conditional Rewriting and New Formalisms
- Hantao Zhang:
Proving Group Isomorphism Theorems (Extended Abstract). 302-306 - Nachum Dershowitz:
Semigroups Satisfying xm+n = xn. 307-314 - Sergei G. Vorobyov:
Could Orders Be Captured By Term Rewriting Systems? 315-327 - Karel Stokkermans:
A Categorical Formulation for Critical-Pair/Completion Procedures. 328-342 - Yabo Wang, David Lorge Parnas:
Trace Rewriting Systems. 343-356 - Ulrich Fraus:
A Calculus for Conditional Inductive Theorem Proving. 357-362
Contextual Rewriting and Constrained Rewriting
- Hantao Zhang:
Implementing Contextual Rewriting. 363-377 - Junnosuke Yamada:
Confluence of Terminating Membership Conditional TRS. 378-392 - Lars With:
Completeness and Confluence of Order-Sorted Term Rewriting. 393-407 - Charles Hoot:
Completion for Constrained Term Rewriting Systems. 408-423 - Akihiko Takano:
Generalized Partial Computation using Disunification to Solve Constraints. 424-428
Aplications to Logic Programming, Normalization Strategies and Unification
- Leszek Pacholski:
Decidability of finiteness properties (Abstract). 429 - Harald Ganzinger, Uwe Waldmann:
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems. 430-437 - Staffan Bonnier, Jonas Wallgren:
Logic Programs with Polymorphic Types: A condition for static type checking. 438-447 - Sergio Antoy:
Normalization by Leftmost Innermost Rewriting. 448-457 - Paola Inverardi, Monica Nesi:
A Strategy to Deal with Divergent Rewrite Systems. 458-467 - Bertrand Delsart:
A New Approach to General E-Unification Based on Conditional Rewriting Systems. 468-482 - Alexander Bockmayr, Stefan Krischer, Andreas Werner:
An Optimal Narrowing Strategy for General Canonical Systems. 483-497 - Wenchang Fang, Jung-Hong Kao:
Set-Of-Support Strategy for Higher-Order Logic. 498-501
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.