Heuristics used by HERBY for semantic tree theorem proving

Author： Yu Q.  

Publisher： Springer Publishing Company

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.23, Iss.3-4, 1998-01, pp. : 247-266

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exploiting parallelism: highly competitive semantic tree theorem prover

By Choon Kyu Kim  

International Journal of Computer Mathematics, Vol. 81, Iss. 9, 2004-09 ,pp. : 1051-1067

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel cooperative propositional theorem proving

By Okushi F.  

Annals of Mathematics and Artificial Intelligence, Vol. 26, Iss. 1-4, 1999-01 ,pp. : 59-85

Springer Publishing Company

Access to resources Recommend Favorite

Using tactics to reformulate formulae for resolution theorem proving

By Kerber M.   Präcklein A.  

Annals of Mathematics and Artificial Intelligence, Vol. 18, Iss. 2-4, 1997-01 ,pp. : 221-241

Springer Publishing Company

Access to resources Recommend Favorite

A Simple Way of Proving the Jordan-Hölder-Schreier Theorem

By Baumslag Benjamin  

American Mathematical Monthly, Vol. 113, Iss. 10, 2006-12 ,pp. : 933-935

Mathematical Association of America

Access to resources Recommend Favorite

Proving the Pythagorean Theorem via Infinite Dissections

By Lengvárszky Zsolt  

American Mathematical Monthly, Vol. 120, Iss. 8, 2013-10 ,pp. : 751-753

Mathematical Association of America

Access to resources Recommend Favorite