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

### From inside the book

Results 1-3 of 9

Page 385

This section begins the paper with a description of how strings can be

represented within a DL using

achieved using subsumption testing over this representation. We begin by first

describing ...

This section begins the paper with a description of how strings can be

represented within a DL using

**suffix trees**and how substring checking can beachieved using subsumption testing over this representation. We begin by first

describing ...

Page 386

ditional

(|S|) edges by collapsing into a single edge each path all of whose nodes have

single successors (paths all of whose nodes have exactly one incoming edge ...

ditional

**suffix**-**tree**representation for a string S (Mc- Creight 1976) only requires 0(|S|) edges by collapsing into a single edge each path all of whose nodes have

single successors (paths all of whose nodes have exactly one incoming edge ...

Page 387

Given a desired set of strings, it is straight-forward to modify the

construction algorithm to create a tree that contains all the desired strings;

conveniently, the DL

generated trees.

Given a desired set of strings, it is straight-forward to modify the

**suffix**-**tree**construction algorithm to create a tree that contains all the desired strings;

conveniently, the DL

**suffix**-**tree**creation algorithm DLST still applies to suchgenerated trees.

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