Timeline for How the Abstract DPLL Algorithm Works in SAT Solving
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2018 at 4:07 | vote | accept | Lance Pollard | ||
| Jul 25, 2018 at 0:01 | history | tweeted | twitter.com/StackCompSci/status/1021908190945005568 | ||
| Jul 24, 2018 at 17:18 | history | edited | Kyle Jones | CC BY-SA 4.0 |
Question doesn't really have anything to do with SMT; edited title and tags to reflect this
|
| Jul 24, 2018 at 17:17 | answer | added | Kyle Jones | timeline score: 4 | |
| Jul 22, 2018 at 0:04 | comment | added | Lance Pollard | This is helpful, the idea of an implication graph. That was left out in most of the papers and resources on DPLL I have seen. Starting to get closer to an actual working implementation level of detail. Then there is the idea of "decision level is incremented by one". More on implementation detail which I'm looking for. | |
| Jul 21, 2018 at 21:19 | history | asked | Lance Pollard | CC BY-SA 4.0 |