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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540677789, 9783540449805

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_16 ◽

2000 ◽

pp. 229-245 ◽

Cited By ~ 2

Author(s):

Jürgen Stuber

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Word Problems and Confluence Problems for Restricted Semi-Thue Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_12 ◽

2000 ◽

pp. 172-186 ◽

Cited By ~ 2

Author(s):

Markus Lohrey

Keyword(s):

Word Problems

Download Full-text

Tree Automata and Term Rewrite Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_2 ◽

2000 ◽

pp. 27-30 ◽

Cited By ~ 6

Author(s):

Sophie Tison

Keyword(s):

Tree Automata ◽

Rewrite Systems ◽

Term Rewrite Systems

Download Full-text

REM (Reduce Elan Machine): Core of the New ELAN Compiler

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_19 ◽

2000 ◽

pp. 265-269 ◽

Cited By ~ 1

Author(s):

Pierre-Etienne Moreau

Download Full-text

Linear Higher-Order Matching Is NP-Complete

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_9 ◽

2000 ◽

pp. 127-140 ◽

Cited By ~ 8

Author(s):

Philippe de Groote

Keyword(s):

Higher Order ◽

Np Complete

Download Full-text

Normal Forms and Reduction for Theories of Binary Relations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_7 ◽

2000 ◽

pp. 95-109 ◽

Cited By ~ 5

Author(s):

Dan Dougherty ◽

Claudio Gutiérrez

Keyword(s):

Normal Forms ◽

Binary Relations

Download Full-text

Parallelism Constraints

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_8 ◽

2000 ◽

pp. 110-126 ◽

Cited By ~ 7

Author(s):

Katrin Erk ◽

Joachim Niehren

Download Full-text

Rewriting Techniques in Theoretical Physics

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_6 ◽

2000 ◽

pp. 80-94

Author(s):

Evelyne Contejean ◽

Antoine Coste ◽

Benjamin Monate

Keyword(s):

Theoretical Physics

Download Full-text

Absolute Explicit Unification

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_3 ◽

2000 ◽

pp. 31-46 ◽

Cited By ~ 3

Author(s):

Nikolaj Bjørner ◽

César Muñoz

Download Full-text

The Explicit Representability of Implicit Generalizations

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/10721975_13 ◽

2000 ◽

pp. 187-202 ◽

Cited By ~ 5

Author(s):

Reinhard Pichler

Download Full-text

Rewriting Techniques and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems

Word Problems and Confluence Problems for Restricted Semi-Thue Systems

Tree Automata and Term Rewrite Systems

REM (Reduce Elan Machine): Core of the New ELAN Compiler

Linear Higher-Order Matching Is NP-Complete

Normal Forms and Reduction for Theories of Binary Relations

Parallelism Constraints

Rewriting Techniques in Theoretical Physics

Absolute Explicit Unification

The Explicit Representability of Implicit Generalizations

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