Journals in DBLP

J. Symb. Comput.
2003, volume: 36, number: 1-2

1. Peter Baumgartner, Hantao Zhang
   Preface to First order theorem proving. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:1-3 [Journal]
   
2. Nicolas Peltier
   Model building with ordered resolution: extracting models from saturated clause sets. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:5-48 [Journal]
   
3. Nicolas Peltier
   A calculus combining resolution and enumeration for building finite models. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:49-77 [Journal]
   
4. Anatoli Degtyarev, Robert Nieuwenhuis, Andrei Voronkov
   Stratified resolution. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:79-99 [Journal]
   
5. Alexandre Riazanov, Andrei Voronkov
   Limited resource strategy in resolution theorem proving. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:101-115 [Journal]
   
6. Bernhard Beckert
   Depth-first proof search without backtracking for free-variable clausal tableaux. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:117-138 [Journal]
   
7. Jens Otten, Wolfgang Bibel
   leanCoP: lean connection-based theorem proving. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:139-161 [Journal]
   
8. Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt
   Hyperresolution for guarded formulae. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:163-192 [Journal]
   
9. Alessandro Armando, Silvio Ranise
   Constraint contextual rewriting. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2003, v:36, n:1-2, pp:193-216 [Journal]
   
10. Jürgen Avenhaus, Thomas Hillenbrand, Bernd Löchner
    On using ground joinable equations in equational theorem proving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:217-233 [Journal]
    
11. Reinhard Pichler
    On the complexity of equational problems in CNF. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:235-269 [Journal]
    
12. Johan G. F. Belinfante
    Computer proofs about finite and regular sets: the unifying concept of subvariance. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:271-285 [Journal]