Encoding Max-CSP into Partial Max-SAT

被引:4
作者
Argelich, Josep [1 ]
Cabiscol, Alba [1 ]
Lynce, Ines [2 ]
Manya, Felip [1 ]
机构
[1] UdL, DIEI, Lleida, Spain
[2] INESC ID, IST, Lisbon, Portugal
来源
38TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2008) | 2008年
关键词
D O I
10.1109/ISMVL.2008.22
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We define a number of original encodings that map Max-CSP instances into Partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding from CSP into SAT which produces fewer clauses than the standard support encoding.
引用
收藏
页码:106 / 111
页数:6
相关论文
共 15 条
[1]   Exact Max-SAT solvers for over-constrained problems [J].
Argelich, J ;
Manya, F .
JOURNAL OF HEURISTICS, 2006, 12 (4-5) :375-392
[2]  
Argelich J, 2007, LECT NOTES COMPUT SC, V4501, P28
[3]  
Bessière C, 2004, LECT NOTES COMPUT SC, V2919, P299
[4]   Resolution for Max-SAT [J].
Bonet, Maria Luisa ;
Levy, Jordi ;
Manya, Felip .
ARTIFICIAL INTELLIGENCE, 2007, 171 (8-9) :606-618
[5]  
Bonet ML, 2006, LECT NOTES COMPUT SC, V4121, P240
[6]  
Gavanelli M, 2007, LECT NOTES COMPUT SC, V4741, P815
[7]  
Genisson R., 1996, 12 EUROPEAN C ARTIFI, P180
[8]  
Gent IP, 2002, FRONT ARTIF INTEL AP, V77, P121
[9]  
Heras F, 2007, LECT NOTES COMPUT SC, V4501, P41
[10]   ON THE PARALLEL COMPLEXITY OF DISCRETE RELAXATION IN CONSTRAINT SATISFACTION NETWORKS [J].
KASIF, S .
ARTIFICIAL INTELLIGENCE, 1990, 45 (03) :275-286