Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. Fazekas, K., Bacchus, F., & Biere, A. In Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, pages 134–151, 2018.
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories [link]Paper  doi  bibtex   
@InProceedings{DBLP:conf/cade/FazekasBB18,
  Title                    = {Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo
 Theories},
  Author                   = {Katalin Fazekas and
 Fahiem Bacchus and
 Armin Biere},
  Booktitle                = {Automated Reasoning - 9th International Joint Conference, {IJCAR}
 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
 UK, July 14-17, 2018, Proceedings},
  Year                     = {2018},
  Pages                    = {134--151},

  Bibsource                = {dblp computer science bibliography, https://dblp.org},
  Biburl                   = {https://dblp.org/rec/bib/conf/cade/FazekasBB18},
  Doi                      = {10.1007/978-3-319-94205-6\_10},
  Timestamp                = {Mon, 09 Jul 2018 12:59:13 +0200},
  Url                      = {https://doi.org/10.1007/978-3-319-94205-6\_10}
}

Downloads: 0