Timeline for Procedure to automatically solve field theorems in a SMT solver
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 23, 2017 at 0:29 | vote | accept | user1868607 | ||
| Aug 20, 2017 at 1:34 | answer | added | D.W.♦ | timeline score: 3 | |
| Aug 20, 2017 at 0:20 | history | tweeted | twitter.com/StackCompSci/status/899063473044418561 | ||
| Aug 19, 2017 at 23:50 | history | edited | user1868607 | CC BY-SA 3.0 |
added 4 characters in body; edited title
|
| Aug 19, 2017 at 23:49 | comment | added | user1868607 | @D.W. I already wrote all this proofs manually, my goal is to automatize this process, that is, construct algorithms that would proof this kind of statements by themselves taking as input previous lemmas | |
| Aug 19, 2017 at 23:41 | comment | added | D.W.♦ | This sounds like a fairly broad question. That's about 18 theorems you want to prove, so it sounds like you're basically asking 18 questions. In any case, if you want to prove those 18 theorems, one possibility is to write down 18 proofs, one for each theorem. Is that really what you're asking? I'm not clear on precisely what your question is. | |
| Aug 19, 2017 at 13:11 | history | edited | user1868607 | CC BY-SA 3.0 |
made the problem explicit , reorganised the layout, gave examples
|
| Aug 9, 2017 at 18:45 | history | asked | user1868607 | CC BY-SA 3.0 |