Abstract
| Original language | English |
|---|---|
| Title of host publication | Computational logic in multi-agent systems: 7th International Workshop, CLIMA VII, Hakodate, Japan, May 8-9, 2006, revised selected and invited papers |
| Editors | K. Inoue, S. Ken, F. Toni |
| Place of Publication | Heidelberg, Germany |
| Publisher | Springer |
| Pages | 60-79 |
| Number of pages | 20 |
| ISBN (Electronic) | 9783540696193 |
| ISBN (Print) | 9783540696186 |
| DOIs | |
| Publication status | Published - 2007 |
| Event | Computational Logic in Multi-Agent Systems. 7th International Workshop, CLIMA VII - Hakodate, Japan Duration: 8 May 2006 → 9 May 2006 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Volume | 4371 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | Computational Logic in Multi-Agent Systems. 7th International Workshop, CLIMA VII |
|---|---|
| Country | Japan |
| City | Hakodate |
| Period | 8/05/06 → 9/05/06 |
Fingerprint
Cite this
Answer set programming for representing and reasoning about virtual institutions. / Cliffe, Owen; De Vos, Marina; Padget, Julian.
Computational logic in multi-agent systems: 7th International Workshop, CLIMA VII, Hakodate, Japan, May 8-9, 2006, revised selected and invited papers . ed. / K. Inoue; S. Ken; F. Toni. Heidelberg, Germany : Springer, 2007. p. 60-79 (Lecture Notes in Computer Science; Vol. 4371).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
ER -