Accession Number : ADA188746
Title : A Calculus for Inheritance in Monotonic Semantic Nets.
Descriptive Note : Interim rept.,
Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Thomason, Richmond H ; Horty, John F ; Touretzky, David S
PDF Url : ADA188746
Report Date : Dec 1987
Pagination or Media Count : 28
Abstract : This report is devoted to a theoretical analysis of inheritance in monotonic semantic nets with positive and negative links, but without relations. We establish several basic results. After setting out the fundamental ideas behind monotonic inheritance, we characterize the inheritance relation through a sequent calculus, or natural-deduction system, that is relatively natural and well-motivated. It is often thought that the logic of monotonic semantic nets, at least, is simply the classical predicate calculus. We show that this is not so. The logic we present is non-classical, and it is proved to be both sound and complete with respect to monotonic inheritance relation is also equivalent to a notion of validity arising from interpretations over a certain four-valued matrix that has been thought to have some computational significance. One traditional attraction of inheritance networks has always been their natural correspondence with graphs, which makes them particularly appropriate as vehicles of knowledge representation for concurrent computing architectures, where graph-searches can be very fast. The last section we present inference algorithms over monotonic semantic nets for such a concurrent architecture, the Parallel Marker Propagation Machine defined by Scott Fahlman. The algorithms are proved to be correct and complete.
Descriptors : *COMPUTER ARCHITECTURE, *SEMANTICS, THEORY, ALGORITHMS, ARCHITECTURE, CALCULUS, COMPUTATIONS, DUAL MODE, GRAPHS, THEORY
Subject Categories : Theoretical Mathematics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE