DocumentCode
1806060
Title
Towards Solving Many-Valued MaxSAT
Author
Argelich, Josep ; Domingo, Xavier ; Li, Chu-Min ; Manyà, Felip ; Planes, Jordi
Author_Institution
Universitat de Lleida, Spain
fYear
2006
fDate
17-20 May 2006
Firstpage
26
Lastpage
26
Abstract
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for solving many-valued MaxSAT, and an exact many-valued MaxSAT solver we have implemented. Finally, we report the experimental investigation we have performed to compare our solver with Boolean MaxSAT solvers on graph coloring instances. The results obtained indicate that many-valued CNF formulas can become a competitive formalism for representing and solving combinatorial optimization problems.
Keywords
Algorithm design and analysis; Design optimization; Encoding; Global Positioning System; Logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2006. ISMVL 2006. 36th International Symposium on
ISSN
0195-623X
Print_ISBN
0-7695-2532-6
Type
conf
DOI
10.1109/ISMVL.2006.43
Filename
1623978
Link To Document