Pym, D;
Anderson, G;
(2015)
Trust domains in system models: algebra, logic, utility, and combinators.
Journal of Logic and Computation
10.1093/logcom/exv030.
![[thumbnail of combinatorsTDs.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/text.png) |
Text
combinatorsTDs.pdf Download (737kB) |
Abstract
Understanding the boundaries of trust is a key aspect of accurately modelling multi-agent systems with heterogeneous motivating factors. Reasoning about these boundaries in highly interconnected, information-rich ecosystems is complex, and dependent upon modelling at the correct level of abstraction. Building on an established mathematical framework, which incorporates both logical and cost-based descriptions of systems, and a formal characterization of trust domains in terms of the above, we develop techniques for the combination and substitution of trust domains.
| Type: | Article |
|---|---|
| Title: | Trust domains in system models: algebra, logic, utility, and combinators |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1093/logcom/exv030 |
| Publisher version: | http://dx.doi.org/10.1093/logcom/exv030 |
| Language: | English |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1464200 |
Archive Staff Only
 |
View Item |
