04268nmm a2200397 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100003500139245020300174250001700377260006300394300003300457505092200490505033801412505060101750653004402351653002502395653002302420653002802443653003902471653005902510653004902569653002802618653005102646700002902697710003402726041001902760989003802779490003802817856006802855082001002923520093702933EB000657935EBX0100000000000000051101700000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835404754911 aRusinowitch, Michaele[editor]00aConditional Term Rewriting SystemshElektronische RessourcebThird International Workshop, CTRS-92, Pont-a-Mousson, France, July 8-10, 1992. Proceedingscedited by Michael Rusinowitch, Jean-Luc Remy a1st ed. 1993 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1993, 1993 aXIII, 507 pbonline resource0 aInductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- 0 aA condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic0 aCompleteness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- aMathematical Logic and Formal Languages aSoftware engineering aMathematical logic aArtificial Intelligence aMathematical Logic and Foundations aSoftware Engineering/Programming and Operating Systems aProgramming languages (Electronic computers) aArtificial intelligence aProgramming Languages, Compilers, Interpreters1 aRemy, Jean-Luce[editor]2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/3-540-56393-8?nosfx=yxVerlag3Volltext0 a005.1 aThis volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively