Festschrift in Honor of Jack Minker |
Contents
Introduction | 135 |
Dynamic maintenance of the transitive closure in disjunctive graphs | 151 |
Term matching on a meshconnected array of processors | 177 |
Copyright | |
8 other sections not shown
Common terms and phrases
A₁ active head algorithm ancestor cancellation arbitrary Artificial Intelligence axiom B₁ backtracking belief atoms belief theory C₁ Cartesian-closed choicepoint closed world assumption compound node Computer Science Conf conjunctive queries contrapositives corresponding Counter(x Datalog Datalog program deductive databases defined deletion Department of Computer disjunctive logic programs disjunctive programs DISLOG DWAM EDB predicate example executing instr fact false fixed point formula get_const graph h₁ h₂ hypergraphs I-code incremental evaluation InH-Prolog insertion least fixed point lemma matching minimal models Minker modal logics near-Horn Prolog negation non-Horn non-monotonic nonrecursive normal programs occurs operator OR-graph out-going arc path Proc procedure program clause proof proposition query-stack Rajasekar recursive refutation S₁ sequence simple node situation calculus SLD-resolution static completion static expansions static semantics stationary theorem transitive closure UNIVERSITY OF CALIFORNIA University of Maryland variables well-founded well-founded semantics YSET