M04.4 CONNECT THE MECHANISM
Search for a proof or a satisfying assignment
Plan a party where Ana won't come without Ben and Ben won't come with Cai. Solve it by brute force, then the clever way modern chip-checking solvers do, and prove what can't happen.
LESSON OVERVIEW13 min lesson
Lesson overview
Plan a party where Ana won't come without Ben and Ben won't come with Cai. Solve it by brute force, then the clever way modern chip-checking solvers do, and prove what can't happen.
What you’ll explore
- Proof search applies formal rules, while satisfiability asks whether any interpretation meets the constraints; computational limits depend on the language and procedure.
GO TO THE SOURCE
Original explanations, connected to the research.
Artificial Intelligence: A Modern Approach — authors’ materialsSuggest a correction
A precise note can make an explanation better.
Choose the scene and describe what needs attention. Download a feedback file to share through a channel you already use. This page does not send feedback or connect you with a reviewer.