Sequential Encodings from Max-CSP into Partial Max-SAT

Authors:
Josep Argelich;Alba Cabiscol;Inês Lynce;Felip Manyà
Affiliations:
INESC-ID, Lisbon, Portugal;Computer Science Department, Universitat de Lleida, Spain;IST/INESC-ID, and Technical University of Lisbon, Portugal;Artificial Intelligence Research Institute (IIIA, CSIC), Spain
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 5
Cited 0

SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Encoding Max-CSP into Partial Max-SAT

ISMVL '08 Proceedings of the 38th International Symposium on Multiple Valued Logic
Regular Encodings from Max-CSP into Partial Max-SAT

ISMVL '09 Proceedings of the 2009 39th International Symposium on Multiple-Valued Logic
Modelling Max-CSP as partial Max-SAT

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Mapping problems with finite-domain variables to problems with boolean variables

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define new encodings from Max-CSP into Partial Max-SAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality constraint ≤ 1 (x 1 , ...,x n ). They have fewer clauses than the existing encodings, and the experimental results indicate that they have a better performance profile.