Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models that are constructed from the syntax of logical theories is defined by generalized diagrams. Further epistemics for computation are defined by introducing der Vielliecht Vorhandenen, and defining an epistemic for computational illusion. A formulation of situations and possible worlds allow us to make precise theoretical statements regarding the computability of AI planning problems. Dynamic Epistemic Computing (Nourani 94) is a consequence of the present approach. It is further shown how knowledge representation by generalized diagrams can be applied to descriptive and dynamic epistemic computing. Applications to the consequence closure problem, comparisons and to new A.I. advances in cardinality for concepts, KR, and cognitive modeling is reviewed.
Cyrus F. Nourani