Three truth values for the SAT and Max-SAT problems

Authors:
Frédéric Lardeux;Frédéric Saubion;Jin-Kao Hao
Affiliations:
LERIA, University of Angers, Angers Cedex;LERIA, University of Angers, Angers Cedex;LERIA, University of Angers, Angers Cedex
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 8
Cited 3

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A machine program for theorem-proving

Communications of the ACM
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Boosting complete techniques thanks to local search methods

Annals of Mathematics and Artificial Intelligence
A Hybrid Approach for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Tabu search for SAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Relaxed survey propagation: a sum-product algorithm for Max-SAT

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Relaxed survey propagation for the weighted maximum satisfiability problem

Journal of Artificial Intelligence Research
Characterizing propagation methods for boolean satisfiability

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

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 andWalksat. Promising results are obtained and show the interest of our approach.