There are two versions of SNePS: The current implementation is
SNePS-2.7, which is the latest in a series beginning with SNePS-2.0.
A completely new implementation, with a very different representational
scheme, is SNePS-3.
There are also two interface languages:
SNePSUL (the SNePS User Language), with a semantic-network-oriented,
Lisp-like syntax
SNePSLOG, with a predicate-logic-like syntax.
Most of the readings below discuss various implementations of SNePS-2.x and
SNePSUL.
To go to the SNePS homepage, click on "SNePS" in the title above.
To go to the complete SNePS bibliography, click on "READINGS" in the
title above.
If you are new to SNePS, I would suggest beginning with:
Note: The representations used in this tutorial are
for pedagogical purposes only, and are
not necessarily the ones that we ourselves use for our research. For
the latter, see Shapiro et al. 1996
(listed below under the heading "Of Practical Interest").
This contains the syntax and semantics of some of the more
common case frames that we have used (though parts of
it have been superseded).
Shapiro, Stuart C. and
Rapaport,
William J. (1992),
"The SNePS Family",
Computers & Mathematics with Applications 23: 243-275;
reprinted in
Fritz Lehmann (ed.), Semantic Networks in Artificial Intelligence
(Oxford: Pergamon Press, 1992): 243-275.
This contains some of the early history of SNePS.
For an introduction to SNeRE, the SNePS Rational Engine (the acting
model) read:
Shapiro, Stuart C.
(1979),
"The SNePS Semantic Network Processing System",
in Nicholas V. Findler (ed.),
Associative Networks: The Representation and Use of
Knowledge by Computers
(New York: Academic Press):
179-203.