Consistency of rule-based expert systems
Consistency of a knowledge-based system has become a topic of growing concern. Every notion of consistency presupposes a notion of semantics. We present a theoretical framework in which both the semantics and the consistency of a knowledge base can be studied. This framework is based on first order flat many-sorted predicate logic and is sufficiently rich to capture an interesting class of rule-based expert systems and deductive databases. We analyse the feasibility of the consistency test and prove that this test is feasible for knowledge bases in Horn format without quantification.
1980 Mathematics Subject Classification68T30 68T15
1987 CR Categories1.2.3 1.2.4 F.4.1
Key Words & Phrasesknowledge-based systems rule-based expert systems knowledge representation consistency
Unable to display preview. Download preview PDF.
- [BS]B.G. Buchanan, E.H. Shortliffe, Rule-based expert systems: the Mycin experiments of the Stanford Heuristic Programming Project. Addison-Wesley, Reading, Massachusetts (1984).Google Scholar
- [GJ]M.R. Garey, D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, California (1979).Google Scholar
- [L]P.J.F. Lucas, Knowledge representation and inference in rule-based expert systems. Report CSR8613, Centre for Mathematics and Computer Science, Amsterdam (1986).Google Scholar
- [M]J.D. Monk, Mathematical Logic, Springer-Verlag, Berlin (1976).Google Scholar
- [R]J.A. Robinson, Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, pp. 227–234 (1965).Google Scholar
- [W]C. Walther, A many-sorted calculus based on resolution and paramodulation. Pitman, London (1987).Google Scholar