Preface to First order theorem proving
Hantao Zhang, Peter Baumgartner
págs. 1-3
págs. 5-48
págs. 49-77
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
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
págs. 193-216
On using ground joinable equations in equational theorem proving
Th. Hillenbrand, B. Löchner, J. Avenhaus
págs. 217-233
págs. 235-269
Computer proofs about finite and regular sets: the unifying concept of subvariance
Johan Gijsbertus Frederik Belinfante
págs. 271-285
© 2001-2024 Fundación Dialnet · Todos los derechos reservados