ML Anthology

New Inference Rules for Efficient Max-SAT Solving

Federico Heras, Javier Larrosa
AAAI 2006 pp. 68-73
/aaai/2006/heras2006aaai-new/

Abstract

In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference rules. The three of them are special cases of Max-SAT resolution with which bet-ter lower bounds and more value pruning is achieved. Our ex-perimental results on several domains show that the resulting algorithm can be orders of magnitude faster than state-of-the-art Max-SAT solvers and the best Weighted CSP solver.

PDF AAAI Semantic Scholar

Cite

Text

Heras and Larrosa. "New Inference Rules for Efficient Max-SAT Solving." AAAI Conference on Artificial Intelligence, 2006.

Markdown

[Heras and Larrosa. "New Inference Rules for Efficient Max-SAT Solving." AAAI Conference on Artificial Intelligence, 2006.](https://mlanthology.org/aaai/2006/heras2006aaai-new/)

BibTeX

@inproceedings{heras2006aaai-new,
  title     = {{New Inference Rules for Efficient Max-SAT Solving}},
  author    = {Heras, Federico and Larrosa, Javier},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2006},
  pages     = {68-73},
  url       = {https://mlanthology.org/aaai/2006/heras2006aaai-new/}
}