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

We present a method for computing stable models of normal logic programs,i.e., logic programs extended with negation, in the presence of predicates witharbitrary terms. Such programs need not have a finite grounding, so traditionalmethods do not apply. Our method relies on the use of a non-Herbrand universe,as well as coinduction, constructive negation and a number of other noveltechniques. Using our method, a normal logic program with predicates can beexecuted directly under the stable model semantics without requiring it to begrounded either before or during execution and without requiring that itsvariables range over a finite domain. As a result, our method is quite generaland supports the use of terms as arguments, including lists and complex datastructures. A prototype implementation and non-trivial applications have beendeveloped to demonstrate the feasibility of our method.

Computing Stable Models of Normal Logic Programs Without Grounding