Proving Theorems by Constructing Closed Semantic Trees

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

Chapter 5 in Automated Theorem Proving, 2001, pp 43-52 from Springer

Abstract: Abstract This chapter provides the theoretical foundations for proving theorems by constructing closed semantic trees. Section 5.1 introduces the Herbrand universe of a set of clauses, Section 5.2 introduces the Herbrand base of a set of clauses, and Section 5.3 introduces the concept of an interpretation on the Herbrand base. The use of a truth table to establish the unsatisfiability of a set of clauses is described in Section 5.4. The use of semantic trees for the same purpose is described in Section 5.5. Constructing noncanonical semantic trees is the subject of Section 5.6. In Chapter 7 , HERBY, a program that constructs such noncanonical semantic trees, is described; HERBY uses a modified variation of Algorithm 5.1, which is described in Section 5.5.

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_5

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

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

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 ().