TransformationToolContest / ttc2019-tt2bdd

Free form TTC contest (Truth tables to Binary Decision Diagrams, from ATL Zoo)
MIT License
5 stars 7 forks source link

Review of NMF #5

Open chrissi007 opened 5 years ago

chrissi007 commented 5 years ago

NMF

NMF demonstrates his implicit incrementalization abilities to automatically create a binary decision tree from a truth table.

Structure

Small remarks

Metrics

  1. Does the solution use the provided benchmark structure, i.e., is a batch execution supported? -> Yes but installation of DotNet.Core.App 2.1 or higher is needed
  2. Can all models be transformed within 10 minutes? -> Not the largest model (one on our machine)
  3. What kind of result is produced? BDT, BDD, with fix order -> Looks like BDT with fix order
  4. Is the transformation correct? -> NMF does not store the bdd models -> Cannot prove if the results are correct
  5. Metrics -> no metrics are computed -> From the descriptions it sound like a complete BDT without optimization
georghinkel commented 5 years ago

As a response, I was not aware that the case description had changed. Therefore, the NMF solution only knows the original BDD model. Likewise, the solution does not print any more metrics although I agree that this would be a useful extension (and also easy to implement).

Regarding dead ends, yes, the solution wil produce dead ends in the BDD if the original truth table is not complete and sometimes even if it is. This is because there is no post-processing done. The solution does not really put a focus on optimality of the result, it is rather an excercise of integrating imperative code blocks into an incrementalized transformation.