Compile: Transforming Well-Formed Formulas to Clauses

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

Chapter 3 in Automated Theorem Proving, 2001, pp 21-28 from Springer

Abstract: Abstract Chapter 2 explained how to write a theorem as a set of wffs. However, neither HERBY nor THEO attempt to find a proof of a theorem expressed in this format. Instead, both require the theorem to be expressed as a set of clauses consisting of the axioms, hypotheses, and negated conclusion. Then, using the clauses as input, an attempt is made to find a proof. The program COMPILE transforms wffs to clauses by carrying out the seven steps described in Section 3.1. Section 3.2 explains how to use COMPILE, with the actual details explained in Section 3.2.1. Examples are given in Section 3.2.2. It should be pointed out that the user can express a theorem as a set of clauses directly, circumventing the need to use COMPILE.

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_3

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

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

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