TY - GEN
T1 - Inducing integrity constraints from knowledge bases
AU - Englert, Roman
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
PY - 1995/1/1
Y1 - 1995/1/1
N2 - 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.
AB - 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.
KW - Inductive logic programming
KW - Integrity constraints
KW - Knowledge revision
KW - Knowledge-based
KW - Search space optimization
KW - Systems
UR - https://www.scopus.com/pages/publications/84950000415
U2 - 10.1007/3-540-60343-3_27
DO - 10.1007/3-540-60343-3_27
M3 - Conference contribution
AN - SCOPUS:84950000415
SN - 9783540603436
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 77
EP - 88
BT - KI 1995
A2 - Wachsmuth, Ipke
A2 - Rollinger, Claus-Rainer
A2 - Brauer, Wilfried
PB - Springer Verlag
T2 - 19th Annual German Conference on Artificial Intelligence, KI 1995
Y2 - 11 September 1995 through 13 September 1995
ER -