Some Remarks on the Semantics of Representation Languages
Topics in information systemsPublished 1 January 1984
David Israël, Ronald J. Brachman
Citations30
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
It has been said many times that semantic nets are mere notational variants of predicate calculus, but before laying down nets, it ought at least to be clear about what predicate calculus is.
Abstract
It has been said many times that semantic nets are mere notational variants of predicate calculus. But before we lay down our nets, we ought at least to be clear about what predicate calculus is. We will attempt to make some clarifications in this regard. We also devote some attention to the notions of semantic nets. In the end, we simply plead, for an open mind.
Keywords
Computer Science
Elsevier eBooksA FRAMEWORK FOR REPRESENTING KNOWLEDGE
4,545 Citations1988Marvin Minsky
The enormous problem of the volume of background common sense knowledge required to understand even very simple natural language texts is discussed and it is suggested that networks of frames are a reasonable approach to represent such knowledge.
The Proper Treatment of Quantification in Ordinary English
2,070 Citations1973Richard Montague
Journal of Symbolic LogicA formulation of the simple theory of types
1,893 Citations1940Alonzo Church
A formulation of the simple theory oftypes which incorporates certain features of the calculus of λ-conversion into the theory of types, and has certain advantages from the point of view of type theory.
Cognitive SciencePhysical Symbol Systems*
1,458 Citations1980Allen Newell
In this paper, the nature of physical symbol systems is laid out in ways familiar, but not thereby useless, to review the basis of common understanding between the various disciplines.
Artificial IntelligenceNon-monotonic logic I
891 Citations1980Drew McDermott, Jon Doyle
A model and proof theories, a proof procedure, and applications for one non-monotonic logic are developed, and it is proved the completeness of the non-Monotonic predicate calculus and the decidability of theNon- monotonic sentential calculus.
Journal of Symbolic LogicCompleteness in the theory of types
842 Citations1950Leon Henkin
This proof demonstrates that each formula of the calculus is a formal theorem which becomes a true sentence under every one of a certain intended class of interpretations of the formal system.
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.
NETL: A System for Representing and Using Real-World Knowledge
528 Citations1979Scott E. Fahlman
A simulator for the parallel network system has been implemented in MACLISP, and an experimental version of NETL, a language for storing real-world information in such a network, is running on this simulator.
Midwest Studies in PhilosophySemantic Innocence and Uncompromising Situations
239 Citations1981Jon Barwise, John Perry
Defense Technical Information Center (DTIC)On The Epistemological Status of Semantic Networks.
162 Citations1978Brachman,Ronald J
On reasoning by default
140 Citations1978Raymond Reiter
A number of kinds of default reasoning in Artificial Intelligence, specifically, default assignments to variables, the closed world assumption, the frame default for causal worlds, exceptions as defaults, and negation in Artificial Artificial Intelligence programming languages are surveyed.
Artificial IntelligenceExtending the expressive power of semantic networks
134 Citations1976Lenhart K. Schubert
Systematic solutions to problems of semantic networks present special problems with respect to the use of logical connectives, quantifiers, descriptions, and certain other constructions will be proposed.
IEEE Transactions on Software EngineeringInitial Report on a Lisp Programmer's Apprentice
126 Citations1978Charles Rich, Howard Shrobe
The initial design and partial implementation of an interactive programming environment to be used by expert programmers and a deductive system which can verify the correctness of plans involving side effects on complex data with structure sharing are described.
National Conference on Artificial IntelligenceWhat's wrong with non-monotonic logic?
66 Citations1980David Israël
In this paper, the motivation behind the wonderfully impressive work involved in its development is based on a confusion of proof-theoretic with epistemological issues.
National Conference on Artificial IntelligenceCompetence in knowledge representation
65 Citations1982Ronald J. Brachman, Hector J. Levesque
Some aspects of current representation research that offer a foundation for coping with complex and incompletenesson knowledge representation systems are reviewed, and a way of integrating these ideas into a powerful, practical knowledge representation paradigm is suggested.
Some computational aspects of situation semantics
8 Citations1981Jon Barwise
John Perry and I have developed a somewhat different approach to the model theory of natural language, a theory the authors call "Situation Semantics", which uses the insights of generalized recursion theory to find a computationally plausible alternative to Montague Grammar.