Author： Gottliebsen Hanne Hardy Ruth Lightfoot Olga Martin Ursula
Publisher： Springer Publishing Company
ISSN： 0934-5043
Source： Formal Aspects of Computing, Vol.25, Iss.6, 2013-11, pp. : 993-1016
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Theorem proving by chain resolution
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
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. :