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

This paper continues the line of research aimed at investigating therelationship between logic programs and first-order theories. We extend thedefinition of program completion to programs with input and output in a subsetof the input language of the ASP grounder gringo, study the relationshipbetween stable models and completion in this context, and describe preliminaryexperiments with the use of two software tools, anthem and vampire, forverifying the correctness of programs with input and output. Proofs of theoremsare based on a lemma that relates the semantics of programs studied in thispaper to stable models of first-order formulas. Under consideration foracceptance in TPLP.

Verifying Tight Logic Programs with anthem and Vampire