Rewriting Techniques and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

41

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540592006, 9783540492238

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A rewrite mechanism for logic programs with negation

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_55 ◽

1995 ◽

pp. 163-178 ◽

Author(s):

Siva Anantharaman ◽

Gilles Richard

Keyword(s):

Download Full-text

Term rewriting in contemporary resolution theorem proving

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_50 ◽

1995 ◽

pp. 101-101

Author(s):

Mark E. Stickel

Keyword(s):

Theorem Proving ◽

Term Rewriting ◽

Resolution Theorem ◽

Resolution Theorem Proving

Download Full-text

On some mathematical logic contributions to rewriting techniques: Lost heritage

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_42 ◽

1995 ◽

pp. 1-1

Author(s):

Yuri Matiyasevich

Keyword(s):

Mathematical Logic

Download Full-text

Explicit substitutions with de bruijn's levels

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_65 ◽

1995 ◽

pp. 294-308 ◽

Author(s):

Pierre Lescanne ◽

Jocelyne Rouyer-Degli

Keyword(s):

Explicit Substitutions

Download Full-text

Regular substitution sets: A means of controlling E-unification

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_71 ◽

1995 ◽

pp. 382-396 ◽

Author(s):

Jochen Burghardt

Download Full-text

Rewrite systems for integer arithmetic

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_67 ◽

1995 ◽

pp. 324-338 ◽

Author(s):

H. R. Walters ◽

H. Zantema

Keyword(s):

Integer Arithmetic ◽

Rewrite Systems

Download Full-text

A complete characterization of termination of 0p 1q→1r 0s

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_46 ◽

1995 ◽

pp. 41-55 ◽

Author(s):

Hans Zantema ◽

Alfons Geser

Keyword(s):

Complete Characterization

Download Full-text

Guiding term reduction through a neural network: Some preliminary results for the group theory

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_80 ◽

1995 ◽

pp. 444-449

Author(s):

Alberto Paccanaro

Keyword(s):

Neural Network ◽

Group Theory ◽

Preliminary Results

Download Full-text

Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_78 ◽

1995 ◽

pp. 432-437

Author(s):

M. Randall Holmes

Keyword(s):

Download Full-text

LEMMA: A system for automated synthesis of recursive programs in equational theories

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-59200-8_76 ◽

1995 ◽

pp. 420-425

Author(s):

Jacques Chazarain ◽

Serge Muller

Keyword(s):

Automated Synthesis ◽

Equational Theories ◽

Recursive Programs

Download Full-text