Herby: A Semantic—Tree Theorem Prover

Monty Newborn ()
Additional contact information
Monty Newborn: McGill University, School of Computer Science

Chapter 7 in Automated Theorem Proving, 2001, pp 85-96 from Springer

Abstract: 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.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0089-2_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461300892

DOI: 10.1007/978-1-4613-0089-2_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().