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

TOTAL DOCUMENTS

40

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540539049, 9783540463832

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Transfinite reductions in orthogonal term rewriting systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_81 ◽

1991 ◽

pp. 1-12 ◽

Author(s):

J. R. Kennaway ◽

J. W. Klop ◽

M. R. Sleep ◽

F. J. Vries

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Goal directed strategies for paramodulation

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_93 ◽

1991 ◽

pp. 150-161 ◽

Author(s):

Wayne Snyder ◽

Christopher Lynch

Download Full-text

Detecting redundant narrowing derivations by the LSE-SL reducibility test

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_87 ◽

1991 ◽

pp. 74-85 ◽

Author(s):

Stefan Krischer ◽

Alexander Bockmayr

Download Full-text

Emmy: A refutational theorem prover for first-order logic with equations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_118 ◽

1991 ◽

pp. 439-441

Author(s):

Aline Deruyver

Keyword(s):

Order Logic ◽

Theorem Prover ◽

First Order Logic ◽

Download Full-text

ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_117 ◽

1991 ◽

pp. 437-438

Author(s):

Michel Billaud

Keyword(s):

Interactive System ◽

Graph Rewriting ◽

Rewriting Systems ◽

Graph Rewriting Systems

Download Full-text

Proving equational and inductive theorems by completion and embedding techniques

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_110 ◽

1991 ◽

pp. 361-373 ◽

Author(s):

J. Avenhaus

Download Full-text

The equivalence of boundary and confluent graph grammars on graph languages of bounded degree

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_106 ◽

1991 ◽

pp. 312-322 ◽

Author(s):

Franz J. Brandenburg

Keyword(s):

Graph Grammars ◽

Bounded Degree ◽

Graph Languages

Download Full-text

Decidability of confluence and termination of monadic term rewriting systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_103 ◽

1991 ◽

pp. 275-286 ◽

Author(s):

Kai Salomaa

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Modular higher-order E-unification

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_97 ◽

1991 ◽

pp. 200-214 ◽

Author(s):

Tobias Nipkow ◽

Zhenyu Qian

Keyword(s):

Download Full-text

Redex capturing in term graph rewriting (concise version)

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-53904-2_82 ◽

1991 ◽

pp. 13-24 ◽

Author(s):

William M. Farmer ◽

Ronald J. Watro

Keyword(s):

Graph Rewriting

Download Full-text