Some relations between predicate calculus and semantic net representations of discourse

Authors:
Robert F. Simmons;Bertram C. Bruce
Affiliations:
Department of Computer Sciences, The University of Texas, Austin, Texas;Department of Computer Sciences, The University of Texas, Austin, Texas
Venue:
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Year:
1971

Citing 4
Cited 2

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A deductive question-answerer for natural language inference

Communications of the ACM
The teachable language comprehender: a simulation program and theory of language

Communications of the ACM
A computer program which "understands"

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I

Extending the expressive power of semantic network

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Some considerations concerning the problem base of purposeful systems

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks can be used to represent syntactic trees of the semantic relations that hold between words in sentences. They can be alternately symbolized as association lists or conjoined sets of triples. A semantic net represents a sentence as a conjoined set of binary predicates. An algorithm is presented that converts a semantic network into predicate calculus formalism. The simpler syntax of semantic network representations in contrast of ordinary predicate logic conventions is taken as an argument for their use in computational applications. Descriptive Terms: Semantic networks, Predicate logic, Natural language, Computational linguistics, Association lists.