TAP
Accessible Autonomous Software
- Background
- What is TAP?
- Researchers
- Who are the TAP prime investigators?
- Industry
- Who are the TAP industrial partners?
- Applications
- Which applications did TAP report on?
The TAP project was funded by Vinnova. The acronym stands for Tillgänglig Autonom Programvara: Swedish for Accessible Autonomous Software. The project started on October 1, 2001 and ran until August 31, 2004. The purpose of TAP was to provide accessible means to users for employing intelligent autonomous software. The TAP project goals were to:
- increase the use of intelligent autonomous software
- design and implement accessible portfolios of agent-based services
- monitor and survey industrial, academic, and de facto standards for services that cater for the special needs of accessible intelligent autonomous software
- investigate and instrumentally use requirements for user integrity, and user trust, in intelligent autonomous software
The senior (Ph.D.) researchers in TAP were all working at the Swedish Institute of Computer Science
The first industrial case in TAP was agent trade servers, investigated in cooperation with the Financial Market Systems division at OM AB (now OMX). This case started late 2001 and was completed in the autumn of 2003.
The second industrial case in TAP was on agent-based modelling of epidemiological processes, investigated in cooperation with the Department of Medical Epidemiology and Biostatistics at Karolinska Institutet, and the Swedish Institute for Infectious Disease Control (SMI). This case ran from late 2002, until the end of the project.
The third industrial case in TAP was on Gesetzgebungslehre and the role of law in artificial societies. This case started in 2003, and was the final TAP application case, running until the end of TAP.
The background to Agent Trade Servers is given on a separate web page.
The second case has restrictions on publication and more information is available upon request. Parts of the mathematical foundation for studies in the third case are available in a paper later published in Annals of Mathematics and Artificial Intelligence. More details will be provided in the forthcoming Ph.D. thesis of Jan Odelstad.