Citations: The practicality of generating semantic trees for proofs of unsatisfiability

Views

CrossRef citations to date

Altmetric

Citations (2)

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Choon Kyu Kim . (2004) Exploiting parallelism: highly competitive semantic tree theorem prover. International Journal of Computer Mathematics 81:9, pages 1051-1067.
Read now

Ahmed Almonayyes, Hazem Raafat, Mohammed Almulla & Rana'a Alharshani. (2001) Improving the time efficiency of proving theorems using a learning mechanism. International Journal of Computer Mathematics 77:2, pages 169-180.
Read now

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

The practicality of generating semantic trees for proofs of unsatisfiability

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

The practicality of generating semantic trees for proofs of unsatisfiability

Citations (2)

Read on this site (2)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date