Transcription of Satisfiability and Validity - MIT OpenCourseWare
{{id}} {{{paragraph}}}
Techniques in Artificial Intelligence Satisfiability and Validity Lecture 4 1. Last time we talked about propositional logic. There's no better way to empty out a room than to talk about logic. So now, -- having gone to all that work of establishing syntax and semantics -- what might you actually want to do with some descriptions that are written down in logic? There are two things that we might want to automatically determine about a sentence of logic. One is Satisfiability , and another is Validity . 1. Techniques in Artificial Intelligence Satisfiability and Validity Satisfiable sentence: there exists a truth value assignment for the variables that makes the sentence true (truth value = t).
Satisfiability and Validity Satisfiable sentence: there exists a truth value assignment for the variables that makes the sentence true (truth value = t). • Algorithm? • Try all the possible assignments to see if one works. Valid sentence: all truth value assignments for the variables make the sentence true. • Algorithm?
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}