English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Satisfiability (SAT) and integer linear programming (ILP) are two related NP-complete problems. They both have a lot of important applications. We study the effectiveness of using them as a complementary tool to each other. We propose three different ILP formulations to solve SAT and compare them with state-of-the-art SAT solvers Berkmin and zchaff. On the other hand, we give two methods to solve ILP by using SAT solvers. In both cases, we achieve speed-ups of several orders for most of our tested examples.

Satisfiability and integer programming as complementary tools