## Proceedings of the ... National Conference on Artificial Intelligence, Volume 14 |

### From inside the book

Results 1-3 of 89

Page 186

A connected

Ei), i = l,...,n is the

called a subgraph of G = (V,£) if V C V and E' C E. A subgraph G' of G is a proper

...

A connected

**graph**without cycles is called a tree. The union of n**graphs**d = (Vi,Ei), i = l,...,n is the

**graph**MjLi d = (U?=i K.U?=i «*)□ The**graph**G' = (V",£") iscalled a subgraph of G = (V,£) if V C V and E' C E. A subgraph G' of G is a proper

...

Page 187

the

clique, i.e., it is the

whose vertex sets do not contain any Sj for j ^ i. The union of Ti over all i is called

...

the

**graph**induced from G by (J, Si with additional edges that make each 5, aclique, i.e., it is the

**graph**G[\Ji Si] U (J, K[Si]. Let Ti be the set of Si-fragments of Gwhose vertex sets do not contain any Sj for j ^ i. The union of Ti over all i is called

...

Page 216

The following lemma holds because in the micro-structure

values are connected by edges. Lemma 1 A CSP with n variables is satisfiable iff

its micro-structure

...

The following lemma holds because in the micro-structure

**graph**compatiblevalues are connected by edges. Lemma 1 A CSP with n variables is satisfiable iff

its micro-structure

**graph**contains a clique of size n. Determining whether a**graph**...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Agent Architecture | 3 |

Agent Coordination | 16 |

Negotiation | 29 |

Copyright | |

48 other sections not shown

### Other editions - View all

### Common terms and phrases

3SAT Abstract action agents algorithm allocation applied approach arc-consistency Artificial Intelligence assignment axioms Bayesian network behavior causal CBASlack chatter clauses coloring complexity component constraint satisfaction constraint satisfaction problems context dataset decision defined denoted described description logic distribution document domain dynamic emotion evaluation example expected value Figure formula function goal graph graph coloring GSAT heuristic commitments inference input literals local search logic Logic Programming method minimal node operators optimal paper parameters performance phase transition planning possible post-failure prob probability problem instances Proc procedure propagation qualitative quasigroup query plan random reasoning representation Research resource retrievable query robot robustness rule rule-base satisfied scheduling Selman semantics sequence servers simulation solution solve source-complete spatial specific strategies structure subgraph suffix tree SumHeight techniques temporal Theorem theory tion tree University unsatisfiable variables WSAT www.aaai.org