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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper introduces the sequential composition of answer set programs. Onthe semantic side, we show that the immediate consequence operator of a programcan be represented via composition, which allows us to compute the least modelsemantics of Horn programs without any explicit reference to operators. As aresult, we can characterize answer sets algebraically, which provides analgebraic characterization of strong and uniform equivalence. In a broadersense, this paper is a first step towards an algebra of answer set programs andin the future we plan to lift the methods of this paper to wider classes ofprograms, most importantly to higher-order and disjunctive programs andextensions thereof.

Sequential composition of answer set programs