数据库管理系统实现技术摘要.pptVIP

Chap.8 基于关系DB实现知识库的方法 8.1 The Datalog Data Model 2. Extensional and Intensional Predicates. 3. Atomic FormulasDatalog programs are built from atomic formulas, which are predicate symbols with a list of arguments. 4. built_in predicatesDefinition: Atomic formulas with the arithmetic comparison predicates. (=, ≤, and so on) e.g. x y 5. Clauses and Horn ClauseslA Clause is a sum (logical OR) of literals.lA Horn clause is a clause with at most one positive literal. Horn Clause’s form:①A single positive literal,e.g p(X,Y) —— fact②One or more negative literals, with no positive literal. —— integrity constraint③A positive literal and one or more negative literals —— rule The rule has the ability of an inference.∵ (1)sibling(x, y) :— parent(x, z) parent(y, z) x≠y ● A collection of Horn clauses is termed a logic program. For rule (1), sibling(X, Y) :— parent(X, Z) parent(Y, Z) X≠Y 6. Dependency Graphs and Recursion p→q denotes q :— p 7. Safe rules e.g. The rule biggerThan(X, Y) :— X Ydefines an infinite relation, if X and Y are allowed to range over the integers, or any infinite set. The approach to avoiding rules that create infinite relation：each variable appearing in the rule is “limited” In general, a variable appearing only in the head of a rule cannot be limited. 8 The Closed World Assumption(CWA) 8.2 Evaluating Nonrecursive Rules ● The Relation Defined by a Rule Body Rule(2) of Fig.8.1cousin(X, Y) :— parent(X, Xp) parent(Y, Yp)  sibling(Xp, Yp) e.g. rule (1) sibling(X, Y) :— parent(X, Z) parent(Y, Z)  X ≠ Y e.g. An abstract example p(X, Y) :— q(a, X) r(X, Z, X) s(Y, Z) …… (1) algorithm 8.1 Computing the Relation for a Rule Body, Using Relational Algebra Operations Rectified Rules Solving method： Introduce new variables for each of the arguments of the head predicate. P(Y1,…,Yk