Author： Padawitz P.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.21, Iss.1, 1996-01, pp. : 41-99
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Theorem proving by chain resolution
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
By Dowek Gilles Hardin Thérèse Kirchner Claude
Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. :
Reductions for non-clausal theorem proving
By Aguilera G. de Guzman I.P. Ojeda-Aciego M. Valverde A.
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
Theorem Proving Based on the Extension Rule
By Hai Lin Jigui Sun Yimin Zhang
Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. :