Solving MAXSAT by Solving a Sequence of Simpler SAT Instances. Davies, J. & Bacchus, F. In Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, pages 225-239, 2011.
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances [link]Link  bibtex   21 downloads  
@InProceedings{DBLP:conf/cp/DaviesB11,
  Title                    = {Solving MAXSAT by Solving a Sequence of Simpler SAT Instances},
  Author                   = {Jessica Davies and
 Fahiem Bacchus},
  Booktitle                = {Principles and Practice of Constraint Programming - CP 2011
 - 17th International Conference, CP 2011, Perugia, Italy,
 September 12-16, 2011. Proceedings},
  Year                     = {2011},
  Pages                    = {225-239},

  Bibsource                = {DBLP, http://dblp.uni-trier.de},
  Ee                       = {http://dx.doi.org/10.1007/978-3-642-23786-7_19},
  Timestamp                = {2018.09.23}
}

Downloads: 21