The week's pick
Random Articles
Reseach Article
Rule-based Knowledge Representation Inspired from Finite Automata
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 21 - Number 3 |
| Year of Publication: 2011 |
| Authors: Nabil M. Hewahi |
10.5120/2493-3367
|
Nabil M. Hewahi . Rule-based Knowledge Representation Inspired from Finite Automata. International Journal of Computer Applications. 21, 3 ( May 2011), 14-17. DOI=10.5120/2493-3367
Abstract
In this paper we present a method for rule based knowledge representation. The proposed approach is inspired from Finite Automata (FA). The inspired FA diagrams are easily used to represent rule-based system and make it more reliable structure in large complicated systems. One of the major additions that gives the proposed structure its significance is that it can represent the rules such that else case, the user text input or user menu input, and the relation and sequence of inputs are considered. The proposed diagram is called (RKRFA).
References
- Bharadwaj K., Jain N., “Hirerichal Censored Production Rules (HCPRs) System”, Data and Knowledge Engineering, Vol. 8, pp. 19-34, 1992.
- Cohen D., “Introduction to Computer Theory”, John Wiley, 1998
- Hewahi N., “ A General Rule Structure”, Information and Software Technology, 44, pp. 451-457, 2002.
- Hewahi N., “Hidden Markov Model for Censored Production Rules”,ICIT 2009, May 3-5, Amman, Jordan, 2009.
- Hewahi N., “An Intelligent Approach For Network Management Based on Hidden Markov Model”,ACIT 2010, Dec. 14-16, Libya, 2010.
- Michalski R., Winston P., “Variable Precision Logic”, Artificial Intelligence 29, pp. 121-145, 1986.
Index Terms
Keywords