Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints release_67bc6krzubcvdffslxonepb46i

by Zhendong Lei, Shaowei Cai, Chuan Luo

Published in International Joint Conference on Artificial Intelligence by International Joint Conferences on Artificial Intelligence Organization.

2020   p1141-1147

Abstract

Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints. In this paper, we introduce Extended Conjunctive Normal Form (ECNF), which expresses cardinality constraints straightforward and does not need auxiliary variables or clauses. Then, we develop a simple and efficient local search solver LS-ECNF with a well designed scoring function under ECNF. We also develop a generalized Unit Propagation (UP) based algorithm to generate the initial solution for local search. We encode instances from Nurse Rostering and Discrete Tomography Problems into CNF with three different cardinality constraint encodings and ECNF respectively. Experimental results show that LS-ECNF has much better performance than state of the art MaxSAT, SAT, Pseudo-Boolean and ILP solvers, which indicates solving cardinality constraints with ECNF is promising.
In application/xml+jats format

Archived Files and Locations

application/pdf  149.1 kB
file_7tqlry47vndnbokltyg5vz67mm
www.ijcai.org (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  paper-conference
Stage   published
Year   2020
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 9b3187f5-ac40-47f5-ad58-f8c375e17164
API URL: JSON