Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
start [2019/04/22 19:42]
jpms
start [2019/05/10 05:54]
jpms
Line 8: Line 8:
  
 ^ Date           ^ News Brief                    ^ ^ Date           ^ News Brief                    ^
 +| 2019/​05/​10 ​    | Paper "​Model-Based Diagnosis with Multiple Observations"​ accepted at IJCAI 2019 (CORE A*)| \\
 | 2019/​04/​22 ​    | Paper "​Assessing Heuristic Machine Learning Explanations with Model Counting"​ accepted at SAT 2019 (CORE A)| \\ | 2019/​04/​22 ​    | Paper "​Assessing Heuristic Machine Learning Explanations with Model Counting"​ accepted at SAT 2019 (CORE A)| \\
 | 2019/​04/​22 ​    | Paper "​DRMaxSAT with MaxHS: First Contact"​ accepted at SAT 2019 (CORE A)| \\ | 2019/​04/​22 ​    | Paper "​DRMaxSAT with MaxHS: First Contact"​ accepted at SAT 2019 (CORE A)| \\
Line 16: Line 17:
 | 2018/​07/​04 ​    | The Reason Lab's RC2 MaxSAT solver received [[floc18|two medals]] at the [[https://​www.floc2018.org/​|FLoC 2018]][[http://​www.labri.fr/​perso/​lsimon/​flog2018/​|Olympic Games]]. | \\ | 2018/​07/​04 ​    | The Reason Lab's RC2 MaxSAT solver received [[floc18|two medals]] at the [[https://​www.floc2018.org/​|FLoC 2018]][[http://​www.labri.fr/​perso/​lsimon/​flog2018/​|Olympic Games]]. | \\
 | 2018/​04/​16 ​    | Paper "​Learning Optimal Decision Trees with SAT" accepted at IJCAI'​2018 (CORE A*) | \\ | 2018/​04/​16 ​    | Paper "​Learning Optimal Decision Trees with SAT" accepted at IJCAI'​2018 (CORE A*) | \\
 +| 2018/​03/​31 ​    | Paper “A SAT-Based Approach to Learn Explainable Decision Sets” accepted at IJCAR'​2018 (CORE A*) | \\
  
 ==== Navigation ==== ==== Navigation ====
Print/export