the concept of a generalized assignment statement and its application to commonsense reasoning  the concept of a generalized assignment statement provides a basis for a unified approach to knowledge representation and inference. the basic idea underlying this approach is that a proposition, p, in a natural language may be viewed as an elastic constraint on a variable, x. more specifically, the meaning of p may be represented as p -&gt; x isr c in which -&gt; should be read as "translates into" and the right-hand member is a representation of the meaning of p in the form of a generalized assignment statement. in this statement, x plays the role of a constrained variable; c is the constraint on x; and r in the copula isr is a variable whose values define the role of c in relation to x. the prinipal values of r are d, standing for disjunctive; c, standing for conjunctive; p, standing for probabilistic; g, standing for granular; and h, standing for hybrid. since in most cases the value of r is d, it is convenient to abbreviate isd to is. with this understanding, x is c should be interpreted as x isd c.  in general, x, c, and r are implicit rather than explicit in p. viewed in this perspective, the problem of meaning representation is that of explicitating x, c and r, given p. in general, x and c are defined procedurally. thus the principal steps in representing the meaning of p are: (1) construction of an explanatory database, ed; (2) construction of a procedure which acts on ed and yields x; and construction of a procedure which acts on ed and yields c.  if p1, …, pu are propositions in a knowledge-base, inference from p1, …, pu starts with representing the meaning of each p1 in the form of a generalized assignment statement, xi isri ci, i = 1, … n. then the constraints are combined through the application of a collection of rules of inference, resulting in a computed constraint, c, on a specified variable y as a function of the ci. in general, the determination of c requires the solution of a non- linear program.  although the approach to knowledge representation and inference based on the concept of a generalized assignment statement does not follow the traditional lines, it is in fact quite natural and easy to understand. several illustrative examples show how a proposition can be expressed as a generalized assignment statement, and how an answer to a question may be obtained through the solution of a nonlinear program.  a particularly important application of the concept of a generalized assignment statement relates to the representation and inference from commonsense knowledge. more specifically, a distinguishing characteristic of commonsense knowledge is that the facts and rules which comprise such knowledges, e.g., birds can fly and tomatoes are red when they are ripe, are, for the most part, preponderantly rather than universally true. for this reason, the concepts of typicality, normality, and default play an essential role in most of the existing approaches to commonsense reasoning and knowledge representation.  in an alternative approach based on the concept of a generalized assignment statement, a comparable role is played by the concept of usuality. as its name suggests, the concept of usuality relates to what is usual or, more precisely, to events of high probability. a basic concept which derives from usuality is that of a usual value of a variable. thus, in the proposition a cup of coffee usually costs about fifty cents, about fifty cents is a usual value of the variable cost (cup coffee)). in general, a usual value is imprecise and non- unique.  viewed in the perspective of usuality, commonsense knowledge may be regarded as a collection of usuality-qualified generalized assignment statements of the form usually (x is f) and usually (x is f if y is r), in which f is a usual value of the variable x, r is a constraint on the conditioning variable y, and usually is a fuzzy quantifier which is representable as a fuzzy proportion in the inverval [0,1].  based on this view of commonsense knowledge, various inference rules for reasoning with usuality-qualified facts and rules are developed. in particular, it is shown that from usually (x is a) and usually (x is b), it follows that (2usually-1) (x is a b), where a b is the conjunction of a and b, and (2usually-1) is a fuzzy number which is less specific that usually. rules of this type are of direct relevance to property inheritance in the presence of exceptions, to the combination of uncertain evidence in expert systems and, more generally, to inference under uncertainty.  l a zadeh