Issue No. 02 - April (1993 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/64.207432
<p>Net representation, which provides a uniform semantics to a wide class of computational problems, such as numeric functions, logical systems, and models of dynamic and distributed systems, is reviewed. Using a uniform formalism of colored propositional nets, the methodology of net models is extended to represent Horn clauses, non-Horn clauses, and expert systems. It is shown that, using this formalism, tools can be built for expanding and partitioning knowledge-bases, and testing knowledge-base properties such as consistency, redundancy, and deadlocks.</p>
A. Whinston, A. Chaudhury and D. C. Marinescu, "Net-Based Computational Models of Knowledge-Processing Systems," in IEEE Intelligent Systems, vol. 8, no. , pp. 79-86, 1993.