## AAAI-97: Proceedings of the Fourteenth National Conference on Artificial Intelligence and The Ninth Annual Conference on Innovative Applications of Artificial Intelligence, Volume 14The annual AAAI National Conference provides a forum for information exchange and interaction among researchers from all subdisciplines of AI. Contributions include theoretical, experimental, and empirical results. Topics cover principles of cognition, perception, and action; the design, application, and evaluation of AI algorithms and systems; architectures and frameworks for classes of AI systems; and analysis of tasks and domains in which intelligent systems perform. Two-volume set Distributed for AAAI Press |

### 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

(ii) For each i at least one S,- fragment of G is included in the fragment set Ts □ (

iii) Every vertex of G is either a vertex in the maximal clique containing Ks in the

in ...

(ii) For each i at least one S,- fragment of G is included in the fragment set Ts □ (

iii) Every vertex of G is either a vertex in the maximal clique containing Ks in the

**graph**G U Ks or a vertex of a fragment in Ts □ (iv) If a vertex v of G is containedin ...

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 Carnegie Mellon University 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 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