Program I - Program I - Resolution Theorem Prover 10 points...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Program I - Resolution Theorem Prover 10 points Due: 12-Feb-2008 Resolution is a powerful rule of inference. In its simplest form, a resolution theorem prover follows a relatively straightforward algorithm as shown below. 1. State the postulated theorem. 2. Negate the theorem. 3. Add the theorem to the list of knowns (axioms). 4. Find two axioms that contain a literal in one axiom and the negation of the literal the other axiom. 5. Combine the two axioms using the resolution rule of inference, adding the resolvant to the axioms. 6. Unless the resolvant is the empty disjunction, repeat from step (4) 7. Report the negation of the theorem as false and therefore the theorem as true. The use of the resolution rule of inference is greatly eased by representing all knowns in conjunctive normal form. Conjunctive normal form means that the entire list of knowns is one large conjunction of disjunctions of literals. You are to implement a Resolution Theorem Prover in Java. The design of the program
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Program I - Program I - Resolution Theorem Prover 10 points...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online