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

There are a huge number of problems, from various areas, being solved byreducing them to SAT. However, for many applications, translation into SAT isperformed by specialized, problem-specific tools. In this paper we describe anew system for uniform solving of a wide class of problems by reducing them toSAT. The system uses a new specification language URSA that combines imperativeand declarative programming paradigms. The reduction to SAT is definedprecisely by the semantics of the specification language. The domain of theapproach is wide (e.g., many NP-complete problems can be simply specified andthen solved by the system) and there are problems easily solvable by theproposed system, while they can be hardly solved by using other programminglanguages or constraint programming systems. So, the system can be seen notonly as a tool for solving problems by reducing them to SAT, but also as ageneral-purpose constraint solving system (for finite domains). In this paper,we also describe an open-source implementation of the described approach. Theperformed experiments suggest that the system is competitive tostate-of-the-art related modelling systems.

URSA: A System for Uniform Reduction to SAT