Proceedings of the Eighth National Conference on Artifical Intelligence: July 29, 1990-august 3, 1990, Volume 1; Volume 8American Association for Artificial Intelligence, 1990 |
From inside the book
Results 1-3 of 94
Page 6
... complete or 2.a. there is a vertex , v , of degree k , whose neighborhood induces a complete graph and b . the graph obtained by removing v and all edges incident to it from G is a k - tree . A simplicial vertex of a k - tree is one ...
... complete or 2.a. there is a vertex , v , of degree k , whose neighborhood induces a complete graph and b . the graph obtained by removing v and all edges incident to it from G is a k - tree . A simplicial vertex of a k - tree is one ...
Page 7
... complete , because the definition of k - trees implies that every vertex in a k - tree of more than k nodes is connected to at least k others that induce a complete graph . Any k - tree vertex with a neighborhood that induces the complete ...
... complete , because the definition of k - trees implies that every vertex in a k - tree of more than k nodes is connected to at least k others that induce a complete graph . Any k - tree vertex with a neighborhood that induces the complete ...
Page 8
... complete graph of k vertices . Consider the i + 1st vertex , v . Its parent set induces a complete graph ( we have a weak k - tree ) . If its parent set contains k vertices , this step is complete . If its parents all lie within the ...
... complete graph of k vertices . Consider the i + 1st vertex , v . Its parent set induces a complete graph ( we have a weak k - tree ) . If its parent set contains k vertices , this step is complete . If its parents all lie within the ...
Other editions - View all
Common terms and phrases
Abstract action active agent algorithm analysis apply approach Artificial Intelligence assumptions axioms backtracking behavior Case-Based Reasoning causal clause clustering complete complete graph component Computer Science conflict consider consistent constraint network constraint satisfaction constraint satisfaction problems context corresponding Dechter default defined definition described diagnosis domain edge equations example execution explanation Figure formula given goal graph heuristic Horn clause implemented inference initial input instantiation interactions k-tree Kleer knowledge base labeling literal logic logic programs method minimal NIMF node ontology operator paper parameters paramodulation parsing partial path performance planner possible prediction prediction interval problem solving procedure Proceedings properties propositional qualitative query reasoning relation represent representation Research robot rules satisfy semantics simulation situation solution specific step strategy symbol task theorem theory tion tree truth maintenance system tuple University values variables