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

TOTAL DOCUMENTS

28

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540629504, 9783540690511

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Prototyping combination of unification algorithms with the ELAN rule-based programming language

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_81 ◽

1997 ◽

pp. 323-326 ◽

Author(s):

Christophe Ringeissen

Keyword(s):

Programming Language ◽

Unification Algorithms

Download Full-text

Finite family developments

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_80 ◽

1997 ◽

pp. 308-322 ◽

Author(s):

Vincent Oostrom

Keyword(s):

Download Full-text

Solving linear Diophantine equations using the geometric structure of the solution space

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_77 ◽

1997 ◽

pp. 269-283 ◽

Author(s):

Ana Paula Tomás ◽

Miguel Filgueiras

Keyword(s):

Geometric Structure ◽

Diophantine Equations ◽

Solution Space ◽

Linear Diophantine Equations

Download Full-text

Shostak's congruence closure as completion

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_59 ◽

1997 ◽

pp. 23-37 ◽

Author(s):

Deepak Kapur

Keyword(s):

Congruence Closure

Download Full-text

New undecidability results for finitely presented monoids

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_62 ◽

1997 ◽

pp. 68-82 ◽

Author(s):

Andrea Sattler-Klein

Keyword(s):

Finitely Presented

Download Full-text

D-bases for polynomial ideals over commutative noetherian rings

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_65 ◽

1997 ◽

pp. 113-127 ◽

Author(s):

Leo Bachmair ◽

Ashish Tiwari

Keyword(s):

Noetherian Rings ◽

Polynomial Ideals

Download Full-text

The invariant package of MAS

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_82 ◽

1997 ◽

pp. 327-330 ◽

Author(s):

Manfred Göbel

Download Full-text

Two-dimensional rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_73 ◽

1997 ◽

pp. 228-229 ◽

Author(s):

Yves Lafont

Keyword(s):

Two Dimensional

Download Full-text

Goal-Directed Completion using SOUR Graphs

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_58 ◽

1997 ◽

pp. 8-22 ◽

Author(s):

Christopher Lynch

Keyword(s):

Directed Completion

Download Full-text

Termination of context-sensitive rewriting

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-62950-5_69 ◽

1997 ◽

pp. 172-186 ◽

Author(s):

H. Zantema

Keyword(s):

Context Sensitive

Download Full-text