Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. Bacchus, F. & Katsirelos, G. In Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, pages 70–86, 2015.
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets [link]Paper  doi  bibtex   
@InProceedings{DBLP:conf/cav/BacchusK15,
  Title                    = {Using Minimal Correction Sets to More Efficiently Compute Minimal
 Unsatisfiable Sets},
  Author                   = {Fahiem Bacchus and
 George Katsirelos},
  Booktitle                = {Computer Aided Verification - 27th International Conference, {CAV}
 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part
 {II}},
  Year                     = {2015},
  Pages                    = {70--86},

  Bibsource                = {dblp computer science bibliography, https://dblp.org},
  Biburl                   = {https://dblp.org/rec/bib/conf/cav/BacchusK15},
  Doi                      = {10.1007/978-3-319-21668-3\_5},
  Timestamp                = {Thu, 25 May 2017 01:00:00 +0200},
  Url                      = {https://doi.org/10.1007/978-3-319-21668-3\_5}
}

Downloads: 0