Timeline for Assignment to make formula unsatisfiable
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2015 at 23:32 | history | tweeted | twitter.com/#!/StackCompSci/status/604430043411062785 | ||
| May 29, 2015 at 21:33 | answer | added | D.W.♦ | timeline score: 4 | |
| May 29, 2015 at 16:03 | vote | accept | Grigor Aghanyan | ||
| May 29, 2015 at 15:43 | answer | added | Yuval Filmus | timeline score: 6 | |
| May 29, 2015 at 15:36 | comment | added | Grigor Aghanyan | Maybe I wasn't clear. After applying assignments for $(S_0,...,S_n)$ we will have another formula $G(A_0 ,..., A_k)$ and this must be unsatisfiable. | |
| May 29, 2015 at 15:34 | comment | added | Dave Clarke | Ignoring the fact that the question doesn't make sense, I think trying to find a solution to $\neg F(A_0,A_1,\ldots, A_k,S_0,\ldots, S_n)$ might be what you are looking for. | |
| May 29, 2015 at 15:26 | comment | added | Raphael | "which will make F unsatisfiable" -- that does not make sense. Do you simply mean "does not satisfy F"? Then you are talking about the problem TAUTOLOGY (resp. it's complement). | |
| May 29, 2015 at 15:19 | history | edited | Grigor Aghanyan | CC BY-SA 3.0 |
added 18 characters in body
|
| May 29, 2015 at 15:01 | review | First posts | |||
| May 29, 2015 at 17:16 | |||||
| May 29, 2015 at 14:58 | history | asked | Grigor Aghanyan | CC BY-SA 3.0 |