![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Bonacina M.P.A.O.L.A.
Publisher: Academic Press
ISSN: 0747-7171
Source: Journal of Symbolic Computation, Vol.21, Iss.4, 1996-04, pp. : 507-522
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Theorem proving by chain resolution
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Dowek Gilles Hardin Thérèse Kirchner Claude
Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :