Journal of symbolic computation

• 

  Año 2003, Vol. 36, Número 1

  • Preface to First order theorem proving

    Hantao Zhang, Peter Baumgartner

    págs. 1-3

    

  • Model building with ordered resolution: extracting models from saturated clause sets

    Nicolas Peltier

    págs. 5-48

    

  • A calculus combining resolution and enumeration for building finite models

    Nicolas Peltier

    págs. 49-77

    

  • Stratified resolution

    Robert Nieuwenhuis, Anatoli Degtyarev, Andrei Voronkov

    págs. 79-99

    

  • Limited resource strategy in resolution theorem proving

    Andrei Voronkov, Alexandre Riazanov

    págs. 101-115

    

  • Depth-first proof search without backtracking for free-variable clausal tableaux

    Bernhard Beckert

    págs. 117-138

    

  • leanCoP: lean connection-based theorem proving

    Wolfgang Bibel, Jens Otten

    págs. 139-161

    

  • Hyperresolution for guarded formulae

    Ullrich Hustadt, Renate A. Schmidt, Lilia Georgieva

    págs. 163-192

    

  • Constraint contextual rewriting

    Alessandro Armando, Silvio Ranise

    págs. 193-216

    

  • On using ground joinable equations in equational theorem proving

    Th. Hillenbrand, B. Löchner, J. Avenhaus

    págs. 217-233

    

  • On the complexity of equational problems in CNF

    Reinhard Pichler

    págs. 235-269

    

  • Computer proofs about finite and regular sets: the unifying concept of subvariance

    Johan Gijsbertus Frederik Belinfante

    págs. 271-285