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

Page 141

The propagation technique is based on the following rule: Body-1 applies a

motion constrained force to body-2 if and only if the force that body-2 applies to

body-1 is resisted by some other motion constrained force

The propagation technique is based on the following rule: Body-1 applies a

motion constrained force to body-2 if and only if the force that body-2 applies to

body-1 is resisted by some other motion constrained force

**applied**to body-1.Page 696

Similarly, if -id is already true before opl is

represented by opld(0) = 1. Also, each additional variable must not be larger than

the corresponding operator variable: op2a(0) < op2(0) opld(0) < opl(O) oplc(0) <

opl(0) ...

Similarly, if -id is already true before opl is

**applied**at time 0, then this isrepresented by opld(0) = 1. Also, each additional variable must not be larger than

the corresponding operator variable: op2a(0) < op2(0) opld(0) < opl(O) oplc(0) <

opl(0) ...

Page 1038

ICCS also features "time- constrained control", which takes imposed dead- fines

into account iii its selection of commands, so as to produce the best possible

circuit within a given time limit. When

practical ...

ICCS also features "time- constrained control", which takes imposed dead- fines

into account iii its selection of commands, so as to produce the best possible

circuit within a given time limit. When

**applied**to the design of large-scalepractical ...

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