Theo:A Resolution—Refutation Theorem Prover

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

Chapter 9 in Automated Theorem Proving, 2001, pp 113-138 from Springer

Abstract: Abstract This chapter describes the procedure used by THEO when attempting to find a proof. THEO passes through four phases during the process. A preliminary phase, Phase 0, attempts to simplify the given base clauses. In Phase 1, a search for a proof is carried out. This phase ends when some main line is found; that is, when THEO knows that it has a proof. If necessary, additional lines are found in the next phase, Phase 2. In Phase 3, the proof is checked for correctness and then printed.

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_9

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

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

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