What people are saying - Write a review
We haven't found any reviews in the usual places.
Dynamic maintenance of the transitive closure in disjunctive graphs
J Lobo Q Yang C Yu G Wang and T Pham
6 other sections not shown
active head algorithm ancestor cancellation arbitrary Artificial Intelligence axiom backtracking belief atoms belief theory Cartesian-closed choicepoint closed world assumption compound node Computer Science Conf conjunctive queries contrapositives corresponding Counter(x Datalog Datalog program Datalog queries deductive databases defined deletion Department of Computer disjunctive logic programs disjunctive programs DISLOG DWAM EDB predicate Editors example executing instr fact failure set problem false fixed point formula geLconst graph hypergraphs I-code implementation incremental evaluation InH-Prolog insertion Jack Jack Minker lemma minimal models Minker modal logics near-Horn Prolog negation non-Horn non-monotonic nonrecursive normal programs occur operator optimization OR-graph out-going arc paper path Proc procedure program clause proof proposition query-stack Rajasekar recursive refutation regular chain query Restart rule sequence simple node situation calculus SLD-resolution static completion static expansions static semantics subtrees theorem transitive closure tree true University of Maryland variables well-founded semantics YSET