This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Net-Based Computational Models of Knowledge-Processing Systems
April 1993 (vol. 8 no. 2)
pp. 79-86

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.

Citation:
Abhijit Chaudhury, Dan C. Marinescu, Andrew Whinston, "Net-Based Computational Models of Knowledge-Processing Systems," IEEE Intelligent Systems, vol. 8, no. 2, pp. 79-86, April 1993, doi:10.1109/64.207432
Usage of this product signifies your acceptance of the Terms of Use.