Skip to main content
SpringerLink
Log in

Consistency of rule-based expert systems

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 310))

Included in the following conference series:

Abstract

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.

Note: The work in this document was conducted as part of the PRISMA project, a joint effort with Philips Research Eindhoven, partially supported by the Dutch "Stimulerings-projectteam Informatica-onderzoek" (SPIN).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. T. Imielinski, W. Lipski jr., Incomplete information in relational databases. Journal of the ACM 31, 4, pp. 761–791 (1984).

    Article  Google Scholar 

  4. 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. J.D. Monk, Mathematical Logic, Springer-Verlag, Berlin (1976).

    Google Scholar 

  6. J.A. Robinson, Automatic deduction with hyper-resolution. International Journal of Computer Mathematics 1, pp. 227–234 (1965).

    Google Scholar 

  7. R. Reiter, Equality and domain closure in first order databases. Journal of the ACM 27, 2, pp. 235–249 (1980).

    Article  Google Scholar 

  8. C. Walther, A many-sorted calculus based on resolution and paramodulation. Pitman, London (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    Marc Bezem

Authors
  1. Marc Bezem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bezem, M. (1988). Consistency of rule-based expert systems. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012830

Download citation

  • DOI: https://doi.org/10.1007/BFb0012830

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation