Three Truth Values for the SAT and MAX-SAT Problems

Abstract

The aim of this paper is to propose a new resolution framework for the SAT and MAX-SAT problems which introduces a third truth value undefined in order to improve the resolution efficiency. Using this framework, we have adapted the classic algorithms Tabu Search and Walksat. Promising results are obtained and show the interest of our approach.

Cite

Text

Lardeux et al. "Three Truth Values for the SAT and MAX-SAT Problems." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Lardeux et al. "Three Truth Values for the SAT and MAX-SAT Problems." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/lardeux2005ijcai-three/)

BibTeX

@inproceedings{lardeux2005ijcai-three,
  title     = {{Three Truth Values for the SAT and MAX-SAT Problems}},
  author    = {Lardeux, Frédéric and Saubion, Frédéric and Hao, Jin-Kao},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {187-192},
  url       = {https://mlanthology.org/ijcai/2005/lardeux2005ijcai-three/}
}