A Translation of Pseudo-Boolean Constraints to SAT | Zendy

Olivier Bailleux | Zendy; Yacine Boufkhad | Zendy; Olivier Roussel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Translation of Pseudo-Boolean Constraints to SAT

Author(s) -

Olivier Bailleux,

Yacine Boufkhad,

Olivier Roussel

Publication year - 2006

Publication title -

journal on satisfiability boolean modeling and computation

Language(s) - English

Resource type - Journals

eISSN - 1875-5011

pISSN - 1574-0617

DOI - 10.3233/sat190021

Subject(s) - translation (biology) , computer science , maximum satisfiability problem , theoretical computer science , mathematics , boolean function , algorithm , genetics , biology , messenger rna , gene

This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and size. The proposed encoding was integrated in a solver based on the zCha SAT solver and submitted to the PB05 evaluation. The results provide new perspectives in the eld of full CNF approach of pseudo-Boolean constraints solving.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research