Browsing by Author "Golemanova, Emilia"
Now showing 1 - 8 of 8
- Results Per Page
- Sort Options
Article Citation - Scopus: 4Control network programming development environments(World Scientific and Engineering Academy and Society Ag. Ioannou Theologou 17-23 Zographou Athens 15773, 2014) Kostadin Kratchanov; Tzanko Golemanov; Buket Yüksel; Emilia Golemanova; Golemanova, Emilia; Yüksel, Buket; Golemanov, Tzanko; Kratchanov, KostadinIn this paper we discuss the unusual distinctive features of Control Network Programming as a hybrid programming paradigm. We postulate the maxim "Primitives + Control Network = Control Network Program" and use this observation in the design of programming environments for developing Control Network Programming projects. The various possible approaches to building such environments are the main focus of the paper together with a relatively detailed presentation of the currently most powerful locally run SpiderCNP environment with graphical editing and tracing as well as two light-weight and ready-to-use cloud-based environments. An extended survey of cloud compilers and IDEs is also included. © 2017 Elsevier B.V. All rights reserved.Conference Object Citation - WoS: 2Citation - Scopus: 7Control Network Programming with SPIDER: Dynamic Search Control(SPRINGER-VERLAG BERLIN, 2010) Kostadin Kratchanov; Tzanko Golemanov; Emilia Golemanova; Tuncay Ercan; Golemanova, Emilia; Ercan, Tuncay; Golemanov, Tzanko; Kratchanov, Kostadin; R Setchi; I Jordanov; RJ Howlett; LC JainThe report describes the means for dynamic control of the computation process that are available in Spider - a language for Control Network Programming.Conference Object Citation - WoS: 4Control Network Programming: Static Search Control with System Options(WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC, 2009) Kostadin Kratchanov; Tzanko Golemanov; Emilia Golemanova; Golemanova, Emilia; Golemanov, Tzanko; Kratchanov, Kostadin; Landgrebe; MA Marino; DL Russell; SH Collicott; M Ceccarelli; JW LundControl Network Programming (CNP) is a programming paradigm that is especially convenient for representing problems with a natural graph-like description. This description is often of nondeterministic nature. The report continues the discussion from [1] on how a CN program is interpreted and executed. The basic algorithm of the interpreter is presented. It is followed by a discussion of the so called system options - these are powerful means for user control of the execution process.Conference Object Citation - WoS: 3Control Network Programs and Their Execution(WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC, 2009) Kostadin Kratchanov; Emilia Golemanova; Tzanko Golemanov; Golemanova, Emilia; Golemanov, Tzanko; Kratchanov, Kostadin; L Trilling; D Perkins; D Dionysios; L Perlovsky; K Davey; D Landgrebe; MA Marino; DL Russell; SH Collicott; M Ceccarelli; JW LundControl Network Programming (CNP) as a new programming paradigm has been presented elsewhere and the CNP approach has been illustrated through solving representative typical applications many of which belong to the AI area. This report aims at more fully specifying the interpretation of a CN program and how the inherently nondeterministic CN program will be computed.Conference Object Citation - WoS: 1Citation - Scopus: 7Non-procedural implementation of local heuristic search in control network programming(Springer-Verlag Berlin, 2010) Kostadin Kratchanov; Emilia Golemanova; Tzanko Golemanov; Tuncay Ercan; Golemanova, Emilia; Ercan, Tuncay; Golemanov, Tzanko; Kratchanov, KostadinThe report describes the type of improved uninformed or heuristic search algorithms that are well-suited for non-procedural implementation in Control network programming and how this can be achieved using the tools for dynamic computation control. © 2010 Springer-Verlag. © 2010 Elsevier B.V. All rights reserved.Conference Object Citation - Scopus: 2Spider vs. Prolog: Computation control(2009) Emilia Golemanova; Kostadin Kratchanov; Tzanko Golemanov; Golemanova, Emilia; Golemanov, Tzanko; Kratchanov, KostadinThis is the second in a series of two reports presenting a comparison between the Control Network Programming language Spider and the logic programming language Prolog. Here the focus is on juxtaposing the tools for programmer's control of the computation (inference) offered by the two languages. © 2009 ACM. © 2010 Elsevier B.V. All rights reserved.Conference Object Citation - Scopus: 1Spider vs. Prolog: Simulating prolog in spider(2009) Tzanko Golemanov; Kostadin Kratchanov; Emilia Golemanova; Golemanova, Emilia; Golemanov, Tzanko; Kratchanov, KostadinControl Network Programming is a programming paradigm that integrates ideas from imperative programming declarative programming rule-based systems nondeterministic programming and graphical programming. Its computation rule is based on an extended specific version of backtracking. The report presents a comparison of the Spider language for control network programming versus the logic programming language Prolog. © 2009 ACM. © 2010 Elsevier B.V. All rights reserved.Conference Object Citation - Scopus: 3Using Control Network Programming in teaching nondeterminism(2012) Kostadin Kratchanov; Emilia Golemanova; Tzanko Golemanov; Burcu Külahçioǧlu; Golemanova, Emilia; Külahçioǧlu, Burcu; Golemanov, Tzanko; Kratchanov, KostadinThe aim of this series of two reports is to demonstrate that Control Network Programming (CNP) respectively WinSpider can be used as an excellent environment for teaching and learning both nondeterminism and randomization. More specifically the focus is on CNP implemented models and algorithms typically studied in courses on Computation theory and Artificial intelligence for students in computing programs. In this first part only teaching the concept of nondeterminism is discussed, the second report to be published elsewhere is devoted to randomized models and algorithms. Copyright © 2012 ACM. © 2012 Elsevier B.V. All rights reserved.

