Fast recall of reusable fuzzy plans using acyclic directed graph memory.
Moataz A. AhmedErnesto DamianiDavid C. RinePublished in: SAC (1998)
Keyphrases
- directed graph
- random walk
- fuzzy sets
- strongly connected
- directed acyclic graph
- fuzzy rules
- membership functions
- graph structure
- memory requirements
- fuzzy clustering
- maximum flow
- fuzzy logic
- high precision
- precision and recall
- undirected graph
- plan recognition
- graph properties
- shortest path problem
- web graph
- software components
- np complete
- planning problems
- initial state
- search algorithm
- neural network