Abstract: Many NP-hard problems are commonly expressed with pseudo-Boolean (PB) constraints, which is a linear arithmetic constraint over Boolean variables. Conjunctive Normal Form (CNF) encoding ...
Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results