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

In this paper we combine Answer Set Programming (ASP) with Dynamic LinearTime Temporal Logic (DLTL) to define a temporal logic programming language forreasoning about complex actions and infinite computations. DLTL extendspropositional temporal logic of linear time with regular programs ofpropositional dynamic logic, which are used for indexing temporal modalities.The action language allows general DLTL formulas to be included in domaindescriptions to constrain the space of possible extensions. We introduce anotion of Temporal Answer Set for domain descriptions, based on the usualnotion of Answer Set. Also, we provide a translation of domain descriptionsinto standard ASP and we use Bounded Model Checking techniques for theverification of DLTL constraints.

Reasoning about Actions with Temporal Answer Sets