Three Truth Values for the SAT and MAX-SAT Problems
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 187-191.
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.
Frédéric Lardeux, Frédéric Saubion, and Jin-Kao Hao. 2005. Three Truth Values for the SAT and MAX-SAT Problems. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 187–191. https://ijcai.org/proceedings/2005/86
Lardeux, F., Saubion, F., & Hao, J. (2005). Three Truth Values for the SAT and MAX-SAT Problems. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 187–191). IJCAI. https://ijcai.org/proceedings/2005/86
@inproceedings{ijcai2005p86,
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 = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {187--191},
year = {2005},
url = {https://ijcai.org/proceedings/2005/86},
}
TY - CPAPER TI - Three Truth Values for the SAT and MAX-SAT Problems AU - Lardeux, Frédéric AU - Saubion, Frédéric AU - Hao, Jin-Kao T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 187 EP - 191 UR - https://ijcai.org/proceedings/2005/86 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
