{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

notes_07_02_08 - Applied Logic Lecture Notes 1 A Proof...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Applied Logic Lecture Notes 07-02-08 1 A Proof Algorithm A paintbot moves along the nodes of the refutation tree of α , painting nodes red or blue according to a specific set of rules. Start. Start at root, in mode , going , with all nodes painted blue . Mode. When going . Mark the current node red . First check for a contradiction with other red nodes. If a contradic- tion is found, don’t move, switch to mode, going . If at leaf node, don’t move, start going . If at branching (weak or strong), move to left child. Otherwise, move to (unique) child. When going . If at root node, halt and return invalid . If at left child of a strong branching, move to right child of branching
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online