Inducing integrity constraints from knowledge bases

  • Roman Englert
Knowledge Organization and Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 981)


Integrity constraints are important logical tools for the general organization of knowledge. Integrity constraints (in short: ICs), which are commonly used in the field of deductive databases, specify general regularities like “a son is not older than his father.” They facilitate the organization of knowledge in expert systems and can speed up the query-response time significantly.

This paper presents an approach for inductively generating compact integrity constraints from knowledge bases, represented in first-order logic. To obtain the most powerful ICs, the huge space of potential ICs, which are principally consistent with a given knowledge base, is restricted by IC-schemes. IC-schemes specify ICs syntactically. The proposed method searches the resulting space of ICs efficiently by pruning away whole subspaces. The approach is also capable of detecting irregularities in “noisy” knowledge bases which might be inconsistent. Empirical results illustrate the appropriateness of this method for finding compact ICs in a reasonable period of time.

Key words

inductive logic programming integrity constraints knowledge-based systems knowledge revision search space optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BG93]
    F. Bergadano and D. Gunetti. An interactive system to learn functional logic programs. In Proceedings of the 13th International Joint Conference on Artifical Intelligence, pages 1044–1049. Morgan Kaufmann, 1993.Google Scholar
  2. [BMM90]
    F. Bry, R. Manthey, and B. Martens. Integrity Verification in Knowledge Bases. Technical Report D.2.1.a, European Computer-Industry Research Centre GmbH (ECRC), München, West Germany, April 1990.Google Scholar
  3. [CM87]
    W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 3nd edition, 1987.Google Scholar
  4. [Dav82]
    Randall Davis. Applications of meta-level knowledge to the construction, maintenance, and use of large knowledge bases. In Randall Davis and Douglas B. Lenat, editors, Knowledge-Based Systems in Artificial Intelligence. McGraw-Hill, New York, 1982.Google Scholar
  5. [DLR94]
    Lud Dehaspe, Wim Van Laer, and Luc De Raedt. Applications of a logical discovery engine. In Proc. of AAAI Workshop on Knowlege Discovery in Databases, 1994. to appear.Google Scholar
  6. [KW92]
    Jörg-Uwe Kietz and Stefan Wrobel. Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models. In Stephen Muggleton, editor, Inductive Logic Programming, chapter 16, pages 335–359. Academic Press, London, 1992.Google Scholar
  7. [LD94]
    Nada Lavrač and Sašo DŽeroski. Inductive Logic Programming. Ellis Horwood Limited, 1st edition, 1994.Google Scholar
  8. [Llo87]
    J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 2nd edition, 1987.Google Scholar
  9. [Min88]
    Jack Minker. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.Google Scholar
  10. [Mor93]
    Katharina Morik. Balanced Cooperative Modeling. Machine Learning, 11:217–235, 1993.Google Scholar
  11. [MR93a]
    Katharina Morik and Anke Rieger. Learning Action-oriented Perceptual Features for Robot Navigation. Technical report, Univ. Dortmund, LS VIII, 1993.Google Scholar
  12. [MR93b]
    Stephen Muggleton and Luc De Raedt. Inductive Logic Programming: Theory and Methods. Journal of Logic Programming, 1993.Google Scholar
  13. [MWKE93]
    Katharina Morik, Stefan Wrobel, J.-U. Kietz, and Werner Emde. Knowledge Acquisition and Machine Learning: Theory Methods and Applications. Academic Press, London, New York, 1993.Google Scholar
  14. [Plo70]
    Gordon D. Plotkin. A Note on Inductive Generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, chapter 8, pages 153–163. American Elsevier, 1970.Google Scholar
  15. [Qui90]
    J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3):239–266, 1990.Google Scholar
  16. [RB93]
    Luc De Raedt and Maurice Bruynooghe. A Theory of Clausal Discovery. In Proc. 22nd International Joint Conference on Artificial Intelligence, 1993.Google Scholar
  17. [Sha83]
    E.Y. Shapiro. Algorithmic Program Debugging. ACM Distinguished Doctoral Dissertations, Cambridge, Mass., 1983. MIT Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Roman Englert
    • 1
  1. 1.Institute of Computer Science IIIUniversity of BonnBonnGermany

Personalised recommendations