Author： Dowek Gilles Hardin Thérèse Kirchner Claude
Publisher： Springer Publishing Company
ISSN： 0168-7433
Source： Journal of Automated Reasoning, Vol.31, Iss.1, 2003-09, pp. : 33-72
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
Proving nonreachability by modulo-invariants
By Desel J. Neuendorf K.-P. Radola M.-D.
Theoretical Computer Science, Vol. 153, Iss. 1, 1996-01 ,pp. :
Access to resources
Recommend
Theorem proving by chain resolution
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,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. :