Commits · 9c8b6e54a05d58dfd6c3e4e6d85d2d806ae2c2e4 · LARA / inox · GitLab

Snippets Groups Projects

Nov 19, 2012
- Rules can (and should) have multiple application alternatives · 9c8b6e54
  Etienne Kneuss authored 12 years ago
  
  9c8b6e54
Nov 14, 2012
- More precise isSolved · 730c2fab
  Etienne Kneuss authored 12 years ago
  
  730c2fab
- With --firstonly we stop as soon as possible, and stop propagating choose() down in the tree · 2be74176
  Etienne Kneuss authored 12 years ago
  
  2be74176
Nov 13, 2012
- Verify preconditions for heuristics · 50b03820
  Etienne Kneuss authored 12 years ago
  
  50b03820
- Lifting defs, making sure the solution complexity takes defs into account · 29764680
  Etienne Kneuss authored 12 years ago
  
  29764680
- Propagate IntInduction's precondition · 7a318dd2
  Etienne Kneuss authored 12 years ago
  
  7a318dd2
- Move cegis and optimistic ground to rules · c9f0f7de
  Etienne Kneuss authored 12 years ago
  
  c9f0f7de
Nov 12, 2012
- Filter based on best solution so far (reimplemented with new multi-steps rules) · 578139b4
  Etienne Kneuss authored 12 years ago
  
  578139b4
- Tentative implementation of multi-steps rules · 8c22a926
  Etienne Kneuss authored 12 years ago
  
  8c22a926
Nov 09, 2012
- Add heuristic exploiting an optimistic assumption about injective nature of functions. · 6fde235e
  Etienne Kneuss authored 12 years ago
  6fde235e
Nov 02, 2012
- Cosmetics · b246598d
  Etienne Kneuss authored 12 years ago
  
  b246598d
- Rework minComplexity of task based on real onSuccess · 7d2512e7
  Etienne Kneuss authored 12 years ago
  
  7d2512e7
- Implement timeouts, trim search horizon based on solution so far · 244f18b6
  Etienne Kneuss authored 12 years ago
  
  244f18b6
- This tends to guarantee termination, better handling of giveups · 862613e1
  Etienne Kneuss authored 12 years ago
  
  862613e1
- Rework complexities a bit · f34ab79b
  Etienne Kneuss authored 12 years ago
  
  f34ab79b
- Rework the derivaion trees with new kinds of Tasks. Add notion of Task... · 9a44a404
  Etienne Kneuss authored 12 years ago
  9a44a404
Nov 01, 2012
- Meh · 78a7e46b
  Etienne Kneuss authored 12 years ago
  
  78a7e46b
- Complexity needs to be carefully extracted/computed · 206fe471
  Etienne Kneuss authored 12 years ago
  
  206fe471
- Some organization · 40ed136d
  Etienne Kneuss authored 12 years ago
  
  40ed136d
- Store sufficient information to track resolution from rootTask · d5815659
  Etienne Kneuss authored 12 years ago
  
  d5815659
- Score solution programatically, not by hand. Allow arbitrary scrutinees (to check) · 70f68bc7
  Etienne Kneuss authored 12 years ago
  
  70f68bc7
Oct 31, 2012
- Decomposing task is a task itself · ecaff254
  Etienne Kneuss authored 12 years ago
  
  ecaff254
Oct 24, 2012
- Fix derivation generations, genreate dot files · 2d495c3f
  Etienne Kneuss authored 12 years ago
  
  2d495c3f
Oct 23, 2012
- Simplify task decomposition by going via task methods · 921978f7
  Etienne Kneuss authored 12 years ago
  
  921978f7
- Meh · 58e83421
  Etienne Kneuss authored 12 years ago
  
  58e83421
- Refactor Tasks, allows for a correct flow · cf9be176
  Etienne Kneuss authored 12 years ago
  
  cf9be176
Oct 22, 2012
- Implement Assert, score solutions to order them · b081084b
  Etienne Kneuss authored 12 years ago
  
  b081084b
- Plop · 47c5deba
  Etienne Kneuss authored 12 years ago
  
  47c5deba
- Rework things around to have a better idea how things work · ea13e438
  Etienne Kneuss authored 12 years ago
  
  ea13e438
Oct 19, 2012
- Ands get decomposed into sub-ands · 6522fc50
  Etienne Kneuss authored 12 years ago
  
  6522fc50
- One-point sort-of works · 651f12e2
  Etienne Kneuss authored 12 years ago
  
  651f12e2
- Stupid example and log output · 06b9bbc7
  Etienne Kneuss authored 12 years ago
  
  06b9bbc7
- This is madness · ea95a62f
  Etienne Kneuss authored 12 years ago
  
  ea95a62f