Answers.Body: <p>SAT problems are decision problems that can be categorised as <em>NPC</em>. This informally means although there has not been any solution that can solve these problem in the polynomial order, the solutions of such problems can be satisfied in <span class="math-container">$O(n^c)$</span>. </p>
  
  <p>About your question, first, you should see your problem has exponential space and cannot be solved in polynomial order; after that, you have to investigate whether its solutions can be satisfied in polynomial time or not. An easy way to model this is to consider the boolean table and an expression to satisfy. Your problem can be considered as the boolean equation and different possibilities of variables can be possible solutions that you may want to verify. </p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-02-25T14:32:06.450Z
Answers.LastActivityDate: 2019-02-25T14:32:06.450Z
Answers.UserDisplayName: Green Falcon
Body: <p>What are (good) daily life examples of SAT problems?</p>
  
  <p>I've thought about this one. The problem of placing a bunch of different kinds of glasses in a shared cabinet in such a way that some constraints would be satisfied, such as putting the longer ones in the back of the shorter ones, so it will be easier to take them when we need. </p>
  
  <p>Is it a good one, or can you think of any other better one?</p>
  
Tags: <problem-solving><satisfiability><constraint-satisfaction-problems>
Title: What are daily life examples of SAT problems?
UserDisplayName: Jay Critch
ThreadText: # What are daily life examples of SAT problems?
  
  (Asked by: username_0 on 2019-02-25)
  
  What are (good) daily life examples of SAT problems?
  
  I've thought about this one. The problem of placing a bunch of different kinds of glasses in a shared cabinet in such a way that some constraints would be satisfied, such as putting the longer ones in the back of the shorter ones, so it will be easier to take them when we need.
  
  Is it a good one, or can you think of any other better one?
  
  **Tags:** problem-solving, satisfiability, constraint-satisfaction-problems
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2019-02-25. Score: 1
  
  SAT problems are decision problems that can be categorised as *NPC*. This informally means although there has not been any solution that can solve these problem in the polynomial order, the solutions of such problems can be satisfied in $O(n^c)$.
  
  About your question, first, you should see your problem has exponential space and cannot be solved in polynomial order; after that, you have to investigate whether its solutions can be satisfied in polynomial time or not. An easy way to model this is to consider the boolean table and an expression to satisfy. Your problem can be considered as the boolean equation and different possibilities of variables can be possible solutions that you may want to verify.
  
  
  ---
  
  