SNePS Considered as a Fully Intensional Propositional Semantic Network
Published 1 January 1987
Stuart C. Shapiro, William J. Rapaport
Citations174
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A formal syntax and semantics for SNePS considered as the (modeled) mind of a cognitive agent is presented, based on a Meinongian theory of the intensional objects of thought that is appropriate for AI considered as "computational philosophy" or "comPUTational psychology".
Abstract
SNePS, the Semantic Network Processing System, is a semantic network language with facilities for building semantic networks to represent virtually any kind of information, retrieving information from them, and performing inference with them. Users can interact with SNePS in a variety of interface languages, including a LISP-like user language, a menu-based screen-oriented editor, a graphics-oriented editor, a higher-order-logic language, and an extendible fragment of English. This article discusses the syntax and semantics for SNePS considered as an intensional knowledge representation system and provides examples of uses of SNePS for cognitive modelling, database management, pattern recognition, expert systems, belief revision, and computational linguistics.
Keywords
Computer Science
Elsevier eBooksWHAT'S IN A LINK
790 Citations1975William A. Woods
The chapter presents the logical inadequacies of almost all current network notations for representing quantified information and also discusses some of the disadvantages of a few logically adequate techniques.
Elsevier eBooksON THE EPISTEMOLOGICAL STATUS OF SEMANTIC NETWORKS**Prepared in part at Bolt Beranek and Newman Inc. under contracts sponsored by the Defense Advance Research Projects Agency and the Office of Naval Research. The views and conclusions stated are those of the author and should not be interpreted as necessarily representing the official policies, either express or implied, of the Defense Advanced Research Projects Agency or the U.S. Government.
623 Citations1979Ronald J. Brachman
This chapter examines in detail the history of a set of network-structured formalisms for knowledge representation—the so-called “semantic networks,” which were introduced around 1966 as a representation for the concepts underlying English words and were designed expressly to treat concepts as formal representational objects.
International Journal of Man-Machine StudiesWhat's in a concept: structural foundations for semantic networks
236 Citations1977Ronald J. Brachman
This paper examines the fundamentals of network notation, in order to understand why the “formalism” has not been the panacea it was once hoped to be and emphasizes the importance of considering an “epistemological foundation” on which to consistently build representations for complex concepts.
Elsevier eBooksAN ESSENTIAL HYBRID REASONING SYSTEM: KNOWLEDGE AND SYMBOL LEVEL ACCOUNTS OF KRYPTON
222 Citations1989Ronald J. Brachman, Victoria Pigman Gilbert +1 more
This work gives here both a formal Knowledge Level view of the user interface to KRYPTON and the technical Symbol Level details of the integration of the two disparate components, thus providing an essential picture of the abstract function that KryPTON computes and the implementation technology needed to make it work.
CogPrints (Cogprints)First Order Theories of Individual Concepts and Propositions.
182 Citations1979John McCarthy
Rst order theories in which individual concepts are admitted as mathematical objects along with the things that reify them allows very straightforward formalizations of knowledge, belief, wanting, and necessity in ordinary rst order logic without modal operators.
Elsevier eBooksTHE SNePS SEMANTIC NETWORK PROCESSING SYSTEM
180 Citations1979Stuart C. Shapiro
This chapter describes the SNePS semantic network processing system, which is a direct descendent of MENTAL and is currently implemented in ALISP and runs interactively on the CDC CYBER 173 at the State University of New York at Buffalo.
Cognitive ScienceIntensional Concepts in Propositional Semantic Networks*
150 Citations1982Anthony S. Maida, Stuart C. Shapiro
It is pointed out that both the networks and the psychologically based networks are prone to memory confusions about knowing unless augmented by domain-specific inference processes, or by structural information.
Computational LinguisticsGeneralized augmented transition network grammars for generation from semantic networks
81 Citations1982Stuart C. Shapiro
Using active connection graphs for reasoning with recursive rules
80 Citations1981Donald P. MoKay, Stuart C. Shapiro
SNIP, the SNaPS Inference Package, can use reouralva rules without causing infinite loopa or requiring that arbitrarily many copies of them be made.
Aristotelian Society Supplementary VolumeA Defence of Arbitrary Objects
78 Citations1983Kit Fine, Neil Tennant
KRYPTON: integrating terminology and assertion
59 Citations1983Ronald J. Brachman, Richard Fikes +1 more
This work has attempted to overcome limitations in a new, hybrid knowledge representation system, called "KRYPTON", which has two representation languages, a frame-based one for forming domain-specific descriptive terms and a logic-basedOne for making statements about the world.
National Conference on Artificial IntelligenceInference with recursive rules
36 Citations1980Stuart C. Shapiro, Donald P. McKay
An inference system that can use recursive rules without causing infinite loops or requiring that arbitrarily many copies of them be made is written.
Path-based and node-based inference in semantic networks
29 Citations1978Stuart C. Shapiro
Two styles of performing inference in semantic networks are presented and compared and a method is described of combining the two styles in a single system in order to take advantage of the strengths of each.
Meinongian semantics for propositional semantic networks
28 Citations1985William J. Rapaport
This paper surveys several approaches to semantic-network semantics that have not previously been treated in the Al or computational linguistics literature, and argues that only a fully intensional ("Meinongran") semantics is appropriate for them.
Quasi-indexical reference in propositional semantic networks
20 Citations1984William J. Rapaport, Stuart C. Shapiro
This work examines the representation of first-person beliefs of others and a computer implementation of these representations using the Semantic Network Processing System (SNePS) and an ATN parser-generator with a question-answering capability.