3.2.3. Row, Column, and Block Constraints

Try these first

1. 1.

   Define a satisfiable proposition.

   Hint

   Think about whether the proposition can be true for some variable values.

2. 2.

   What is CNF?

   Hint

   Remember it helps simplify logical expressions.

3. 3.

   What is a satisfiable proposition?

   • A proposition that is false
   • A proposition that is true under at least one assignment
   • A proposition that has no assignments

   Hint

   Think about the definition of truth in logic.

4. 4.

   True or False: The SAT problem only applies to mathematical equations.

   • True
   • False

   Hint

   Consider where satisfiability is relevant.

5. 5.

   Create a CNF expression for the proposition (A OR B) AND (NOT A OR C). Explain the process.

   Hint

   Consider the logical structure and remember what defines a CNF.

6. 6.

   You are given the expression (X AND (Y OR Z)) AND (NOT X OR Y). Convert it to CNF and explain your reasoning.

   Hint

   Follow distribution laws and identify clauses in your process.