Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient storage and retrieval in protocol libraries using subsumption hierarchies
| Content Provider | Semantic Scholar |
|---|---|
| Author | Miller, Tim McBurney, Peter |
| Copyright Year | 2010 |
| Abstract | For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly locate a protocol that achieves its goals. Techniques such as model checking or theorem proving can be used to assess whether a protocol achieves a goal; however, for resource bound agents, this approach may be inefficient. Building on previous work on characterising and matching protocols, we present a method for structuring and searching protocol libraries using subsumption hierarchies. These hierarchies are directed graphs, in which the vertices are characterisations of protocols, and edges record a relation between two characterisations if one characterisation subsumes the other; that is, the characterised protocol achieves all of the same outcomes. An experimental analysis demonstrates that this approach is more efficient for anything other than the smallest of protocol libraries. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://intranet.csc.liv.ac.uk/research/techreports/tr2010/ulcs-10-002.pdf |
| Alternate Webpage(s) | http://www.csc.liv.ac.uk/research/techreports/tr2010/ulcs-10-002.pdf |
| Alternate Webpage(s) | https://www.csc.liv.ac.uk/research/techreports/tr2010/ulcs-10-002.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
