Learning improved integrity constraints and schemas from exceptions in databases and knowledge bases

In order to set up efficient storage structures and detect errors in the data being stored, the designers of data and knowledge base management systems must initially build schema and integrity constraints that anticipate the kind of facts that are to be stored. The purpose of this chapter is to demonstrate some ways in which a KBMS can be endowed with the ability to refine its schema on the basis of the data actually stored so far. In particular, due to the unpredictability and evolution of the natural world, as well as possible errors made by designers, a KBMS must be tolerant of occasional deviations from the norms set out during design — in other words, it must accommodate exceptions. Two techniques are presented through which a computer system can suggest modifications and additions to the current definitions and semantic integrity constraints of a knowledge base by “ learning from the exceptions encountered. One schema refinement method is based on generalizing from example exceptions to form descriptions of classes of similar objects. The other technique refines integrity constraints by” explaining the occurrence of exceptions in terms of a detailed theoretical world-model and then generalizing to those cases where similar explanations hold.

[1]  Steven A. Vere,et al.  Inductive learning of relational productions , 1977, SGAR.

[2]  Jonathan J. King Intelligent Retrieval Planning , 1980, AAAI.

[3]  Frederick Hayes-Roth Patterns of induction and associated knowledge acquisition algorithms , 1976 .

[4]  Tom M. Mitchell,et al.  Learning and Problem Solving , 1983, IJCAI.

[5]  Hector J. Levesque,et al.  Krypton: A Functional Approach to Knowledge Representation , 1983, Computer.

[6]  David W. Shipman,et al.  The functional data model and the data languages DAPLEX , 1981, TODS.

[7]  David W. Shipman The functional data model and the data language DAPLEX , 1979, SIGMOD '79.

[8]  Ch Chen,et al.  Pattern recognition and artificial intelligence , 1976 .

[9]  Stephen Fox,et al.  Storage and Access Structures to Support a Semantic Data Model , 1982, VLDB.

[10]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[11]  Alexander Borgida,et al.  Features Of Languages for the Development of Information Systems at the conceptual Level , 1985, IEEE Software.

[12]  Nicholas V. Findler,et al.  Associative Networks- Representation and Use of Knowledge by Computers , 1980, CL.

[13]  P. Winston Learning by Augmenting Rules and Accumulating Censors. , 1982 .

[14]  Donald A. Waterman,et al.  Pattern-Directed Inference Systems , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Alexander Borgida,et al.  Language features for flexible handling of exceptions in information systems , 1985, TODS.

[16]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.