Associative Networks: The Representation and Use of Knowledge of Computers - Hardcover

Hardcover

ISBN 10: 0122563808 ISBN 13: 9780122563805

Publisher: Academic Pr, 1979

Synopsis

Associative Representation and Use of Knowledge by Computers is a collection of papers that deals with knowledge base of programs exhibiting some operational aspects of understanding. One paper reviews network formalism that utilizes unobstructed semantics, independent of the domain to which it is applied, that is also capable of handling significant epistemological relationships of concept structuring, attribute/value inheritance, multiple descriptions. Another paper explains network notations that encode taxonomic information; general statements involving quantification; information about processes and procedures; the delineation of local contexts, as well as the relationships between syntactic units and their interpretations. One paper shows that networks can be designed to be intuitively and formally interpretable. Network formalisms are computer-oriented logics which become distinctly significant when access paths from concepts to propositions are built into them. One feature of a topical network organization is its potential for learning. If one topic is too large, it could be broken down where groupings of propositions under the split topics are then based on "co-usage" statistics. As an example, one paper cites the University of Maryland artificial intelligence (AI) group which investigates the control and interaction of a meaning-based parser. The group also analyzes the inferences and predictions from a number of levels based on mundane inferences of actions and causes that can be used in AI. The collection can be useful for computer engineers, computer programmers, mathematicians, and researchers who are working on artificial intelligence.

Edition details

• Publisher: Academic Pr
• Publication date: 1979
• Language: English
• ISBN 10: 0122563808
• ISBN 13: 9780122563805
• Binding: Hardcover
• Number of pages: 462
• Editor: Findler Nicholas V.