TY - GEN
T1 - Answer set programming for representing and reasoning about virtual institutions
AU - Cliffe, Owen
AU - De Vos, Marina
AU - Padget, Julian
PY - 2007
Y1 - 2007
N2 - It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in other safety-critical scenarios, it is possible to prove that particular properties do or do not hold for all possible encounters. In contrast to symbolic model-checking, answer set programming permits the statement of problems and queries in domain-specific terms as executable logic programs, thus eliminating the gap between specification and verification language. Furthermore, results are presented in the same terms. In this paper we describe the use of answer set programs as an institutional modelling technique. We demonstrate that our institutional model can be intuitively be mapped into an answer set program such that the ordered event traces of the former can be obtained as the answer sets of the latter, allowing for an easy way to query properties of models.
AB - It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in other safety-critical scenarios, it is possible to prove that particular properties do or do not hold for all possible encounters. In contrast to symbolic model-checking, answer set programming permits the statement of problems and queries in domain-specific terms as executable logic programs, thus eliminating the gap between specification and verification language. Furthermore, results are presented in the same terms. In this paper we describe the use of answer set programs as an institutional modelling technique. We demonstrate that our institutional model can be intuitively be mapped into an answer set program such that the ordered event traces of the former can be obtained as the answer sets of the latter, allowing for an easy way to query properties of models.
UR - http://dx.doi.org/10.1007/978-3-540-69619-3_4
U2 - 10.1007/978-3-540-69619-3_4
DO - 10.1007/978-3-540-69619-3_4
M3 - Conference contribution
SN - 9783540696186
T3 - Lecture Notes in Computer Science
SP - 60
EP - 79
BT - Computational logic in multi-agent systems: 7th International Workshop, CLIMA VII, Hakodate, Japan, May 8-9, 2006, revised selected and invited papers
A2 - Inoue, K.
A2 - Ken, S.
A2 - Toni, F.
PB - Springer
CY - Heidelberg, Germany
T2 - Computational Logic in Multi-Agent Systems. 7th International Workshop, CLIMA VII
Y2 - 8 May 2006 through 9 May 2006
ER -