Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.

Saved in:

Bibliographic Details
Title:	Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.
Authors:	ARGELICH, JOSEP¹, CABISCOL, ALBA¹, LYNCE, INÊS², MANYÀ, FELIP³ felip@iiia.csic.es
Source:	Journal of Multiple-Valued Logic & Soft Computing. 2012, Vol. 19 Issue 1-3, p3-23. 21p. 3 Charts.
Subjects:	CSP (Computer program language), Computer simulation, Empirical research, Performance evaluation, Machine learning
Abstract:	We first survey existing encondings from CSP into SAT, and define two new encodings: the minimal support encoding and the interval-based support encoding. Then, we study how the existing and new encodings from CSP into SAT can be extended for encoding MaxCSP into Partial MaxSAT. Finally, we report on the empirical investigation. The obtained results provide empirical evidence of the good performance profile of the new encodings on SAT solvers such as MiniSat and PrecoSAT that incorporate conflict-clause learning, as well as when they are used to encode MaxCSP into Partial MaxSAT and are solved with MaxSAT solvers such as MSUnCore, SAT4J-Maxsat and WMaxSatz. [ABSTRACT FROM AUTHOR]
	Copyright of Journal of Multiple-Valued Logic & Soft Computing is the property of Old City Publishing, Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	We first survey existing encondings from CSP into SAT, and define two new encodings: the minimal support encoding and the interval-based support encoding. Then, we study how the existing and new encodings from CSP into SAT can be extended for encoding MaxCSP into Partial MaxSAT. Finally, we report on the empirical investigation. The obtained results provide empirical evidence of the good performance profile of the new encodings on SAT solvers such as MiniSat and PrecoSAT that incorporate conflict-clause learning, as well as when they are used to encode MaxCSP into Partial MaxSAT and are solved with MaxSAT solvers such as MSUnCore, SAT4J-Maxsat and WMaxSatz. [ABSTRACT FROM AUTHOR]
ISSN:	15423980