The study of string constraints and symbolic computation encompasses the development of methods and algorithms for analysing and solving problems where variables represent sequences of characters.

In this article we present some of the fundamental principles of a research program—the Sub-Symbolic Paradigm (SSP)—based on a particular approach to unifying connectionist and symbolic computation.

Don’t get me wrong. Like most people, there’s nothing I enjoy more than solving a long, involved math problem by hand. But, sometimes, a few pages of algebraic scratches on paper is just a means to an ...

Jeremy Johnson is Professor of Computer Science and Electrical and Computer Engineering at Drexel University. He served as the first Department Head for the newly formed Computer Science department ...

Unsupervised, model-free method preserves key data better than traditional statistical techniques for next generation cognitive ML for multi-modal data. These methods prove the utility of algorithmic ...