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

Whereas the operation of forgetting has recently seen a considerable amountof attention in the context of Answer Set Programming (ASP), most of it hasfocused on theoretical aspects, leaving the practical issues largely untouched.Recent studies include results about what sets of properties operators shouldsatisfy, as well as the abstract characterization of several operators andtheir theoretical limits. However, no concrete operators have beeninvestigated.  In this paper, we address this issue by presenting the first concreteoperator that satisfies strong persistence - a property that seems to bestcapture the essence of forgetting in the context of ASP - whenever this ispossible, and many other important properties. The operator is syntactic,limiting the computation of the forgetting result to manipulating the rules inwhich the atoms to be forgotten occur, naturally yielding a forgetting resultthat is close to the original program.  This paper is under consideration for acceptance in TPLP.

A Syntactic Operator for Forgetting that Satisfies Strong Persistence