Journals in DBLP

J. Symb. Comput.
2000, volume: 29, number: 2

1. Chandrabose Aravindan, Peter Baumgartner
   Theorem Proving Techniques for View Deletion in Databases. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:119-147 [Journal]
   
2. Matthias Baaz, Alexander Leitsch
   Cut-elimination and Redundancy-elimination by Resolution. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:149-177 [Journal]
   
3. Ricardo Caferra, Nicolas Peltier
   Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:177-211 [Journal]
   
4. Reinhard Pichler
   Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:213-257 [Journal]
   
5. Andrea Formisano, Eugenio G. Omodeo, Marco Temperini
   Goals and Benchmarks for Automated Map Reasoning. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:259-297 [Journal]
   
6. Marc Fuchs
   Controlled Use of Clausal Lemmas in Connection Tableau Calculi. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:299-341 [Journal]
   
7. Pedro J. Martín, Antonio Gavilanes, Javier Leach
   Tableau Methods for a Logic with Term Declarations. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:343-372 [Journal]
   
8. Uwe Petermann
   Connection Calculus Theorem Proving with Multiple Built-in Theories. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2000, v:29, n:2, pp:373-392 [Journal]