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 proposes a method which makes full use of the functions of information representation and procedural and declarative knowledge of S-model to derive programs using abstract data-types such as sets and relations and to refine them to programs manipulating arrays and pointers. In this method, program derivation requires 2-phases; first, a syntax-type (a program control struc ture and related subproblems with it) is generated by analyzing the structure of problem input output specifications and constraints, and by using rules and axioms in S-model's knowledge-base, and then solution program model is derived by the multi-level search based on the syntax-type. Functions of S-model mentioned above are also indispensable for data refinement, as the refine ment is essentially redesign of data structures in the concrete level.

Model-based Derivation and Refinement of Abstract Programs