Constraint Programming Technique for the Automated Combination of Networks of Functional Groupings of Spiking Neurons

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.


Bennett, Adam Earl




Existing training techniques for spiking neural networks tend to be monolithic in nature and scale poorly to larger networks.

This thesis aims to address this issue by providing an automated technique for combining certain types of functional groupings of spiking neurons into composite functional networks. The technique takes the form of an algorithm which uses constraint programming to ensure that four axioms hold true in the network; the axioms having been designed to ensure that signals arrive simultaneously to component groupings. A number of experiments were conducted in which the algorithm was used to combine component groupings into more complex composite networks; these experiments show the practical utility of the algorithm and reinforce by demonstration the correctness of the axioms. Networks designed for the experiments include memory registers which store binary values, binary counters, and a robot-control network for navigating a variant of the maze described by the T-Maze problem.


Artificial Intelligence
Computer Science




Carleton University

Thesis Degree Name: 

Master of Computer Science: 

Thesis Degree Level: 


Thesis Degree Discipline: 

Computer Science

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).