skip to main content
10.1145/2383276.2383333acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Using control network programming in teaching nondeterminism

Published: 22 June 2012 Publication History

Abstract

The 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.

References

[1]
ANTLR: http://www.antlr.org/. Retrieved 2012-06-29
[2]
Armoni, M. and Ben-Ari, M.: The Concept of Nondeterminism: Its Development and Implications to Teaching, ACM SIGCSE Bulletin, v. 41, No. 2 (2009)
[3]
Armoni, M, Lewenstein, N. and Ben-Ari, M.: Teaching Students to Think Nondeterministically, SIGCSE '08, Portland, OR (2008)
[4]
Ben-Ari, M.: Teaching concurrency and nondeterminism with Spin, ACM SIGCSE Bulletin, Vol. 39, No. 3 (2007)
[5]
Chesñevar, C, Cobo, M. and Yurcik, W.: Using Theoretical Computer Simulators for Formal Languages and Automata Theory, ACM SIGCSE Bulletin, Vol. 35, No. 2, pp.33--37. Also: http://cs.uns.edu.ar/~cic/2003/2003_sigcse.pdf (2003)
[6]
Christiansen, H.: Prolog as Description and Implementation Language in Computer Science Teaching, http://akira.ruc.dk/~henning/publications/christiansenteachlp2004.pdf. Retrieved 2012-06-29
[7]
Christiansen, H.: Using Prolog as Metalanguage for Teaching Programming Language Concepts, In Kacprzyk J., Krawczak, M. and Zadrozny, S. (eds.) Issues in Information Technology, EXIT, Warszawa, pp. 59--82 (2002)
[8]
Compiler-compilers: http://www.answers.com/main/ntquery?s=compiler+generator. Retrieved 2012-06-29
[9]
Esmoris, A., Chesñevar, C. and González, M.: TAGS: A Software Tool for Simulating Transducer Automata, Int. J. for Electronical Engineering Education (IJEEE), Vol. 42, No. 4, pp. 338--349 (2005)
[10]
Golemanova E., Kratchanov, K., Golemanov, T. Spider vs. Prolog: Computation Control, In: 10th Int. Conf. on Computer Systems and Technologies, Rousse, Bulgaria, pp. II.10-1--II.10-6, Also: ACM International Conference Proceeding Series, Vol. 433 (2009)
[11]
Greenlaw, R. and Hoover, H.: Fundamentals of the Theory of Computation: Principles and Practice, Morgan Kaufmann Publ., San Francisco (1998)
[12]
Hein, J.: Prolog Experiments in Discrete Mathematics, Logic, and Computability, www.cs.pdx.edu/~jhein/books/PrologLabBook09.pdf (2009). Retrieved 2012-06-29
[13]
Hromkoviĉ, J.: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed., Springer (2010)
[14]
JFLAP: http://www.cs.duke.edu/csed/jflap/. Retrieved 2012-06-29
[15]
Johnsonbaugh, R. and Schaefer, M.: Algorithms, Pearson -- Prentice Hall (2004)
[16]
Kratchanov, K., Golemanov, T. and Golemanova, E.: Control Network Programs: Static Search Control with System Options. In: 8th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED 2009), Cambridge, UK, pp. 423--428, WSEAS Press (2009)
[17]
Kratchanov, K., Golemanov, T, Golemanova, E and Ercan, T.: Control Network Programming with SPIDER: Dynamic Search Control, In: Knowledge-Based and Intelligent Information and Engineering Systems, Proc. 14th Intl Conf. (KES 2010), Cardiff, UK, Sep 2010, Part II, Lecture Notes in Artificial Intelligence), v.6277, Springer, pp. 253--262 (2010)
[18]
Kratchanov, K., Golemanova, E. and Golemanov, T.: Control Network Programming Illustrated: Solving Problems With Inherent Graph-Like Structure. In: 7th IEEE/ACIS Conf. on Computer and Information Science (ICIS 2008), Portland, Oregon, USA, pp. 453--459, IEEE Computer Society Press, Los Alamitos, CA (2008)
[19]
Kratchanov, K., Golemanova, E. and Golemanov, T.: Control Network Programs and Their Execution, In: 8th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED 2009), Cambridge, UK, 2009, pp. 417--422, WSEAS Press (2009)
[20]
Kratchanov, K., Golemanova, E., Golemanov, T. and Ercan, T. Non-Procedural Implementation of Local Heuristic Search in Control Network Programming, In: Knowledge-Based and Intelligent Information and Engineering Systems, Proc. 14th Intl Conf. (KES 2010), Cardiff, UK, Sep 2010, Part II, Lecture Notes in Artificial Intelligence), v.6277, Springer, pp. 263--272 (2010)
[21]
Kratchanov, K., Golemanova, E., Golemanov, T. and Gökçen, Y.: Implementing Search Strategies in Winspider I: Introduction to Control Network Programming and Search. In: Stanev, I. and K. Grigorova (eds.): Knowledge-Based Automated Software Engineering, Cambridge Scholars Publ., pp. 87--113 (2012)
[22]
Kratchanov, K., Golemanova, E, Golemanov, T. and Gökçen, Y.: Implementing Search Strategies in Winspider II: Declarative, Procedural, and Hybrid Approaches. In: Stanev, I. and K. Grigorova (eds.): Knowledge-Based Automated Software Engineering, Cambridge Scholars Publ., pp. 115--135 (2012)
[23]
Lacerda, B.: Matlab Function Library of Finite State Automata Operations, http://users.isr.ist.utl.pt/~pal/cadeiras/deds0708/deds/Projects06-07/BLacerda.pdf
[24]
Linz, P.: An Introduction to Formal Languages and Automata, 5th ed., Jones & Bartlett (2012)
[25]
Maróti, G.: Didactic approach for teaching nondeterminism in automata theory, ZDM, Vol. 35, No. 2, pp. 48--55 (2003)
[26]
Martin, C. and olde Scheper, T.: Teaching Tools for Turing Machines, http://tech.brookes.ac.uk/people/clare.martin/wp-content/uploads/2008/09/martin scheper. pdf (2003). Retrieved 2012-06-29
[27]
Nondeterminism, http://www.answers.com/topic/nondeterminism-1. Retrieved 2012-06-29
[28]
Parr, T.: The Definitive ANTLR Reference, The Pragmatic Bookshelf (2007)
[29]
Sipser, M.: Introduction to the Theory of Computation, 2nd ed., Thomson (2006)
[30]
UPPAAL, http://www.uppaal.org/. Retrieved 2012-06-29
[31]
Wegener, I.: Teaching Nondeterminism as a Special Case of Randomization, Informatica Didactica, 4 (2002)
[32]
Wikipedia: Nondeterministic Programming: http://en.wikipedia.org/wiki/Nondeterministic_programming. Retrieved 2012-06-29

Cited By

View all
  • (2022)Genetic Algorithms in a Visual Declarative ProgrammingWSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS10.37394/23209.2022.19.1419(138-152)Online publication date: 21-Jun-2022

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. CNP
  2. algorithms
  3. artificial intelligence
  4. computation models
  5. computation theory
  6. control network programming
  7. nondeterminism
  8. nondeterministic computation
  9. teaching computing

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Genetic Algorithms in a Visual Declarative ProgrammingWSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS10.37394/23209.2022.19.1419(138-152)Online publication date: 21-Jun-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media