Conferences in DBLP
Karl Meinke Algebraic Semantics of Rewriting Terms and Types. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:1-20 [Conf ] Stefan Kahrs Context Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:21-35 [Conf ] Kristoffer Høgsbro Rose Explicit Cyclic Substitutions. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:36-50 [Conf ] Richard Banach Simple Type Inference for Term Graph Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:51-66 [Conf ] 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 ] Aart Middeldorp Completeness of Combinations of Conditional Constructor Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:82-96 [Conf ] Detlef Plump Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:97-112 [Conf ] Enno Ohlebusch Combinations of Simplifying Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:113-127 [Conf ] Bernhard Gramlich Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:128-142 [Conf ] 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 ] Hans Zantema Type Removal in Term Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:148-154 [Conf ] Hans Zantema Termination of Term Rewriting by Interpretation. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:155-167 [Conf ] Nachum Dershowitz , Subrata Mitra Path Orderings for Termination of Associative-Commutative Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:168-174 [Conf ] Peter Padawitz Generic Induction Proofs. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:175-197 [Conf ] 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 ] Klaus Becker Semantics for Positive/Negative Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:213-225 [Conf ] 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 ] François Bronsard , Uday S. Reddy Reduction Techniques for First-Order Reasoning. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:242-256 [Conf ] 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 ] 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 ] Dieter Hofbauer , Maria Huber Computing Linearizations Using Test Sets. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:287-301 [Conf ] Hantao Zhang Proving Group Isomorphism Theorems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:302-306 [Conf ] Nachum Dershowitz Semigroups Satisfying xm+n = xn . [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:307-314 [Conf ] Sergei G. Vorobyov Could Orders Be Captured By Term Rewriting Systems? [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:315-327 [Conf ] Karel Stokkermans A Categorical Formulation for Critical-Pair/Completion Procedures. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:328-342 [Conf ] Yabo Wang , David Lorge Parnas Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:343-356 [Conf ] Ulrich Fraus A Calculus for Conditional Inductive Theorem Proving. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:357-362 [Conf ] Hantao Zhang Implementing Contextual Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:363-377 [Conf ] Junnosuke Yamada Confluence of Terminating Membership Conditional TRS. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:378-392 [Conf ] Lars With Completeness and Confluence of Order-Sorted Term Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:393-407 [Conf ] Charles Hoot Completion for Constrained Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:408-423 [Conf ] Akihiko Takano Generalized Partial Computation using Disunification to Solve Constraints. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:424-428 [Conf ] Leszek Pacholski Decidability of finiteness properties (Abstract). [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:429- [Conf ] 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 ] 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 ] Sergio Antoy Normalization by Leftmost Innermost Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:448-457 [Conf ] Paola Inverardi , Monica Nesi A Strategy to Deal with Divergent Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:458-467 [Conf ] 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 ] 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 ] Wenchang Fang , Jung-Hong Kao Set-Of-Support Strategy for Higher-Order Logic. [Citation Graph (0, 0)][DBLP ] CTRS, 1992, pp:498-501 [Conf ]