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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Answer Set Programming (ASP) is a popular declarative programming languagefor solving hard combinatorial problems. Although ASP has gained widespreadacceptance in academic and industrial contexts, there are certain user groupswho may find it more advantageous to employ a higher-level language thatclosely resembles natural language when specifying ASP programs. In this paper,we propose a novel tool, called CNL2ASP, for translating English sentencesexpressed in a controlled natural language (CNL) form into ASP. In particular,we first provide a definition of the type of sentences allowed by our CNL andtheir translation as ASP rules, and then exemplify the usage of the CNL for thespecification of both synthetic and real-world combinatorial problems. Finally,we report the results of an experimental analysis conducted on the real-worldproblems to compare the performance of automatically generated encodings withthe ones written by ASP practitioners, showing that our tool can obtainsatisfactory performance on these benchmarks. Under consideration in Theory andPractice of Logic Programming (TPLP).

CNL2ASP: converting controlled natural language sentences into ASP