Consistency of rule-based expert systems

  • Marc Bezem
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


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 Classification

68T30 68T15 

1987 CR Categories

1.2.3 1.2.4 F.4.1 

Key Words & Phrases

knowledge-based systems rule-based expert systems knowledge representation consistency 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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
  2. [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
  3. [IL]
    T. Imielinski, W. Lipski jr., Incomplete information in relational databases. Journal of the ACM 31, 4, pp. 761–791 (1984).CrossRefGoogle Scholar
  4. [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
  5. [M]
    J.D. Monk, Mathematical Logic, Springer-Verlag, Berlin (1976).Google Scholar
  6. [R]
    J.A. Robinson, Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, pp. 227–234 (1965).Google Scholar
  7. [Re]
    R. Reiter, Equality and domain closure in first order databases. Journal of the ACM 27, 2, pp. 235–249 (1980).CrossRefGoogle Scholar
  8. [W]
    C. Walther, A many-sorted calculus based on resolution and paramodulation. Pitman, London (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Marc Bezem
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations