IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0089-2_7.html
   My bibliography  Save this book chapter

Herby: A Semantic—Tree Theorem Prover

In: Automated Theorem Proving

Author

Listed:
  • Monty Newborn

    (McGill University, School of Computer Science)

Abstract

It was shown in Chapter 5 that, in theory, a closed canonical semantic tree can be constructed for any unsatisfiable set of clauses. In practice, constructing closed canonical semantic trees is not a very effective procedure because often far too many atoms must be selected before a closed tree is obtained. However, as was also discussed in Chapter 5 , semantic trees need not be canonical and, when this is the case, a stronger theorem prover can be designed. HERBY is just such a prover, although it is still considerably weaker than programs that use resolution-refutation.

Suggested Citation

  • Monty Newborn, 2001. "Herby: A Semantic—Tree Theorem Prover," Springer Books, in: Automated Theorem Proving, chapter 7, pages 85-96, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0089-2_7
    DOI: 10.1007/978-1-4613-0089-2_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-0089-2_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.