Now showing items 91-96 of 96
Graph Patterns: Structure, Query Answering and Applications in Schema Mappings and Formal Language Theory
(The University of Edinburgh, 2013)
Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, i.e., graph patterns. Queries need ...
The Design and Development of an Artificial Hand incorporating function and cosmesis
(University of Edinburgh, 1974)
Active Learning - An Explicit Treatment of Unreliable Parameters
Active learning reduces annotation costs for supervised learning by concentrating labelling efforts on the most informative data. Most active learning methods assume that the model structure is fixed in advance and focus ...
Computational Logic: Structure sharing and proof of program properties
This thesis describes the results of two studies in computational logic. The first concerns a very efficient method of implementing resolution theorem provers. The second concerns a non-resolution program which automatically ...
Runtime Verification of Deontic and Trust Models in Multiagent Interactions
(The University of Edinburgh, 2008)
In distributed open systems, such as multiagent systems, new interactions are constantly appearing and new agents are continuously joining or leaving. It is unrealistic to expect agents to automatically trust new ...
Addressing Constraint Failures in Distributed Dialogue Protocols
(The University of Edinburgh, 2003)
Early agent communication languages lacked the means to coordinate the interaction between agents. The importance of coordination was better appreciated when open systems became in favor. Some solutions have been proposed; ...