loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
36th International Symposium on Multiple-Valued Logic (ISMVL'06)
Towards Solving Many-Valued MaxSAT
Singapore
May 17-May 20
ISBN: 0-7695-2532-6
ASCII Text
x 
 
Josep Argelich, Xavier Domingo, Chu-Min Li, Felip Manya, Jordi Planes, "Towards Solving Many-Valued MaxSAT," Multiple-Valued Logic, IEEE International Symposium on, pp. 26, 36th International Symposium on Multiple-Valued Logic (ISMVL'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ISMVL.2006.43,
author = {Josep Argelich and Xavier Domingo and Chu-Min Li and Felip Manya and Jordi Planes},
title = {Towards Solving Many-Valued MaxSAT},
journal ={Multiple-Valued Logic, IEEE International Symposium on},
volume = {0},
year = {2006},
issn = {0195-623X},
pages = {26},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2006.43},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Multiple-Valued Logic, IEEE International Symposium on
TI - Towards Solving Many-Valued MaxSAT
SN - 0195-623X
SP
EP
A1 - Josep Argelich,
A1 - Xavier Domingo,
A1 - Chu-Min Li,
A1 - Felip Manya,
A1 - Jordi Planes,
PY - 2006
KW - null
VL - 0
JA - Multiple-Valued Logic, IEEE International Symposium on
ER -
 
Josep Argelich, Universitat de Lleida, Spain
Xavier Domingo, GPS MicroSAT, Spain
Chu-Min Li, Universite de Picardie, France
Felip Manya, IIIA-CSIC, Spain
Jordi Planes, Universitat de Lleida, Spain
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.
Citation:
Josep Argelich, Xavier Domingo, Chu-Min Li, Felip Manya, Jordi Planes, "Towards Solving Many-Valued MaxSAT," ismvl, pp.26, 36th International Symposium on Multiple-Valued Logic (ISMVL'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.