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

We introduce an approach that aims to combine the usage of satisfiabilitymodulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)Sframework. (CL)S is a tool for the automatic composition of software componentsfrom a user-specified repository. The framework yields a tree grammar thatcontains all composed terms that comply with a target type. Type specificationsfor (CL)S are based on combinatory logic with intersection types. Our approachtranslates the tree grammar into SMT functions, which allows the considerationof additional domain-specific constraints. We demonstrate the usefulness of ourapproach in several experiments.

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories