Representing and pattern-matching sequences in Atomese

[Ben Goertzel]

Thinking about how to most elegantly represent sequences in Atomese, I
noted this paper

https://pdfs.semanticscholar.org/cd5f/5831111b557642e02c08052f1d84dfcc82ca.pdf

which basically argues that using flexible-arity sequence functions
makes things nice and easy (in terms of representing and manipulating
sequences in predicate logic)

Thinking about how nicely Mathematica deals with pattern matching on
sequence variables, I also dug up this reference

https://arxiv.org/pdf/1705.00907.pdf

which explains how to efficiently do pattern matching on sequence
variables in most practical cases (see sections 4.2.1 and 3.3.2)

This stuff came up in the context of stochastic language generation,
where we want to represent the partially-formed sentences being
generated as sequences of Atoms ... but of course there are many other
applications also...

-- Ben


--
Ben Goertzel, PhD
http://goertzel.org

"In the province of the mind, what one believes to be true is true or
becomes true, within certain limits to be found experientially and
experimentally. These limits are further beliefs to be transcended. In
the mind, there are no limits.... In the province of connected minds,
what the network believes to be true, either is true or becomes true
within certain limits to be found experientially and experimentally.
These limits are further beliefs to be transcended. In the network's
mind there are no limits." -- John Lilly