Journals in DBLP

J. Symb. Comput.
1987, volume: 3, number: 1/2

1. Bruno Buchberger
   History and Basic Features of the Critical-Pair/Completion Procedure. [Citation Graph (1, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:3-38 [Journal]
   
2. Ronald V. Book
   Thue Systems as Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:39-68 [Journal]
   
3. Nachum Dershowitz
   Termination of Rewriting. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:69-116 [Journal]
   
4. Michaël Rusinowitch
   Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:117-131 [Journal]
   
5. Jieh Hsiang
   Rewrite Method for Theorem Proving in First Order Theory with Equality. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:133-151 [Journal]
   
6. Katherine A. Yelick
   Unification in Combinations of Collapse-Free Regular Theories. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:153-181 [Journal]
   
7. Erik Tidén, Stefan Arnborg
   Unification Problems with One-Sided Distributivity. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:183-202 [Journal]
   
8. Dan Benanav, Deepak Kapur, Paliath Narendran
   Complexity of Matching Problems. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 1987, v:3, n:1/2, pp:203-216 [Journal]