Consistency and Completeness Checking of Rule Bases Using Pr/T Nets


, Journal of Information Processing Systems Vol. 3, No. 1, pp. 51-60, Feb. 2002  


Fulltext:

Abstract

The conventional procedure to verify rule bases are corresponding to the propositional logic-level knowledge representation. Building knowledge bases, in real applications, we utilize the predicate logic-level rules. In this paper, we present a verification algorithm of rule bases using Pr/T nets which represent the predicate logic-level rules naturally.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
조상엽 (2002). Consistency and Completeness Checking of Rule Bases Using Pr/T Nets. Journal of Internet Computing and Services, 3(1), 51-60.

[IEEE Style]
조상엽, "Consistency and Completeness Checking of Rule Bases Using Pr/T Nets," Journal of Internet Computing and Services, vol. 3, no. 1, pp. 51-60, 2002.

[ACM Style]
조상엽. 2002. Consistency and Completeness Checking of Rule Bases Using Pr/T Nets. Journal of Internet Computing and Services, 3, 1, (2002), 51-60.