We present a technique to remedy this problem by recovering cardinality constraints from CNF on the fly during search. This is done by collecting potential ...

Our main conclusion is that the overhead of our approach is not too high on average, while at the same time we are able to solve a number of formulas faster ...

This work presents a technique to recover cardinality constraints from CNF on the fly during search by collecting potential building blocks of cardinality ...

A Cardinal Improvement to Pseudo-Boolean Solving. In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20) (pp. 1495-1503). AAAI Press.

Sep 8, 2023 · Bibliographic details on A Cardinal Improvement to Pseudo-Boolean Solving.

The basic pseudo-Boolean solver combines conflict-driven search based on the cutting planes proof system with techniques from integer linear programming (ILP) ...

We propose a modified approach to pseudo-Boolean solving based on division instead of the saturation rule used in [Chai and Kuehlmann '05] and other PB solvers.

Mar 17, 2021 · A cardinal improvement to pseudo-Boolean solving. In Proceedings of the 34th AAAI Conference on Artificial Intelligence. (AAAI '20), pages ...

Sep 22, 2023 · This paper develops a novel local search framework for PBO, which has three main ideas. First, we design a two-level selection strategy to evaluate all ...

In this work, we consider the use of CDCL for pseudo- Boolean solving, where the pseudo-Boolean input (i.e., a 0-1 integer linear program) is translated to CNF ...