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
start [2018/11/15 09:04]
jpms
start [2019/06/07 21:39] (current)
jpms
Line 8: Line 8:
  
 ^ Date           ^ News Brief                    ^ ^ Date           ^ News Brief                    ^
 +| 2019/​06/​07 ​    | Paper "​Computing Shortest Resolution Proofs"​ accepted at EPIA 2019| \\
 +| 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 "​DRMaxSAT with MaxHS: First Contact"​ accepted at SAT 2019 (CORE A)| \\
 +| 2019/​04/​22 ​    | Paper "On Computing the Union of MUSes" accepted at SAT 2019 (CORE A)| \\
 +| 2018/​12/​16 ​    | Paper "​Efficient Symmetry Breaking for SAT-based Minimum DFA Inference"​ accepted at LATA 2019 (CORE C) | \\
 | 2018/​10/​31 ​    | Paper "​Abduction-Based Explanations for Machine Learning Models"​ accepted at AAAI 2019 (CORE A*) | \\ | 2018/​10/​31 ​    | Paper "​Abduction-Based Explanations for Machine Learning Models"​ accepted at AAAI 2019 (CORE A*) | \\
 | 2018/​10/​19 ​    | Paper "​Formally Verifying the Solution to the Boolean Pythagorean Triples Problem,"​ accepted at Journal of Automated Reasoning (CORE A) | \\ | 2018/​10/​19 ​    | Paper "​Formally Verifying the Solution to the Boolean Pythagorean Triples Problem,"​ accepted at Journal of Automated Reasoning (CORE A) | \\
 | 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/​04/​06 ​    | Invited Paper "​Computing with SAT Oracles: Past, Present & Future"​ accepted at CiE'​2018 (CORE C) | \\ 
 | 2018/​03/​31 ​    | Paper “A SAT-Based Approach to Learn Explainable Decision Sets” accepted at IJCAR'​2018 (CORE A*) | \\ | 2018/​03/​31 ​    | Paper “A SAT-Based Approach to Learn Explainable Decision Sets” accepted at IJCAR'​2018 (CORE A*) | \\
-| 2018/​03/​31 ​    | Paper “PySAT: A Python Toolkit for Prototyping with SAT Oracles” accepted at SAT'​2018 (CORE A) | \\ 
-| 2017/​11/​08 ​    | Paper “MaxSAT Resolution with the Dual Rail Encoding” accepted at AAAI'​2018 (CORE A*) | \\ 
-| 2017/​11/​08 ​    | Paper “Premise Set Caching for Enumerating Minimal Correction Subsets” accepted at AAAI'​2018 (CORE A*) | \\ 
-| 2017/​11/​08 ​    | Paper “On Cryptographic Attacks Using Backdoors for SAT” accepted at AAAI'​2018 (CORE A*) | \\ 
  
 ==== Navigation ==== ==== Navigation ====
Print/export