Resolution-Refutation Proofs

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

Chapter 6 in Automated Theorem Proving, 2001, pp 53-84 from Springer

Abstract: Abstract This chapter establishes the theoretical foundations of resolution-refutation theorem proving as carried out by THEO. A resolution-refutation proof is a proof in which some sequence of inferences performed on a theorem’s base clauses and on resulting inferences derives the NULL clause. Inferences generated by THEO are restricted to binary resolution and binary factoring.

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_6

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

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

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