## Proceedings of the ... National Conference on Artificial Intelligence, Volume 14American Association for Artificial Intelligence, 1997 - Artificial intelligence |

### From inside the book

Results 1-3 of 66

Page 24

One key architectural novelty in STEAM is team

which instantiate a team's joint intentions, and thus facilitate reasoning about

teamwork. Team

One key architectural novelty in STEAM is team

**operators**(reactive team plans),which instantiate a team's joint intentions, and thus facilitate reasoning about

teamwork. Team

**operators**explicitly express a team's joint activities, unlike the ...Page 697

The fifth and sixth constraints relate the values of the step variables to the

0, and s2(i) cannot be higher than sl(i — 1). If an

one ...

The fifth and sixth constraints relate the values of the step variables to the

**operator**variables. The last two constraints represent the ordering; s2(0) must be0, and s2(i) cannot be higher than sl(i — 1). If an

**operator**is used for more thanone ...

Page 698

A random block-world instance for a given number of blocks selects a random

initial state and goal state from a uniform distribution of possible blocks- world

states. The number of

A random block-world instance for a given number of blocks selects a random

initial state and goal state from a uniform distribution of possible blocks- world

states. The number of

**operators**in each instance was reduced. E.g., if block A is ...### 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