Syntax and Semantics for Cinnamon Programming

Kratchanov, Kostadin

doi:10.5121/ijcsit.2017.9510

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2022

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Comparative Study of the Inference Mechanisms in PROLOG and SPIDER

Golemanova¹,

Golemanov²,

Kratchanov³

2018

View full text Add to dashboard Cite

Control Network Programming (CNP) is a graphical nonprocedural programming style whose built-in inference engine (interpreter) is based on search in a recursive network. This paper is the third in a series of reports that share a common objective – comparison between the CNP language SPIDER and the logic programming language PROLOG. The focus here is on the comparative investigation of their interpreters, presented in a generic formal frame – reduction of goals. As a result of juxtaposing their pseudo-codes the advantages of SPIDER are outlined.

show abstract

Comparative Study of the Inference Mechanisms in PROLOG and SPIDER

Golemanova¹,

Golemanov²,

Kratchanov³

2018

View full text Add to dashboard Cite

show abstract

Genetic Algorithms in a Visual Declarative Programming

Golemanova

Golemanov

2022

Wseas Transactions on Information Science and Applications

View full text Add to dashboard Cite

mperative languages like Java, C++, and Python are mostly used for the implementation of Genetic algorithms (GA). Other programming paradigms are far from being an object of study. The paper explores the advantages of a new non-mainstream programming paradigm, with declarative and nondeterministic features, in the implementation of GA. Control Network Programming (CNP) is a visual declarative style of programming in which the program is a set of recursive graphs, that are graphically visualized and developed. The paper demonstrates how the GA can be implemented in an automatic, i.e. non-procedural (declarative) way, using the built-in CNP inference mechanism and tools for its control. The CNP programs are easy to develop and comprehend, thus, CNP can be considered a convenient programming paradigm for efficient teaching and learning of nondeterministic, heuristic, and stochastic algorithms, and in particular GA. The outcomes of using CNP in delivering a course on Advanced Algorithm Design are shown and analyzed, and they strongly support the positive results in teaching when CNP is applied.

show abstract

Syntax and Semantics for Cinnamon Programming

Abstract: Cinnamons are a new computation model intended to form a theoretical foundation for Control Network Programming (CNP

Cited by 2 publications

References 20 publications

Comparative Study of the Inference Mechanisms in PROLOG and SPIDER

Comparative Study of the Inference Mechanisms in PROLOG and SPIDER

Genetic Algorithms in a Visual Declarative Programming

Contact Info

Product

Resources

About