Runtime commitment verification is an important, open issue in multiagent research. To address it, we build on Yolum and Singh’s formalization of commitment operations, on Chittaro and Montanari’s cached event calculus, and on the SCIFF abductive logic programming proof-procedure. We propose a framework consisting of a declarative and compact language to express the domain knowledge, and a reactive and complete procedure to track the status of commitments effectively, producing provably sound and irrevocable answers.
Commitment Tracking via the Reactive Event Calculus / M. Montali; F. Chesani; P. Mello; P. Torroni. - STAMPA. - (2009), pp. 91-96. (Intervento presentato al convegno IJCAI 2009, 21st International Joint Conference on Artificial Intelligence tenutosi a Pasadena, California, USA nel July 11-17, 2009).
Commitment Tracking via the Reactive Event Calculus
MONTALI, MARCO;CHESANI, FEDERICO;MELLO, PAOLA;TORRONI, PAOLO
2009
Abstract
Runtime commitment verification is an important, open issue in multiagent research. To address it, we build on Yolum and Singh’s formalization of commitment operations, on Chittaro and Montanari’s cached event calculus, and on the SCIFF abductive logic programming proof-procedure. We propose a framework consisting of a declarative and compact language to express the domain knowledge, and a reactive and complete procedure to track the status of commitments effectively, producing provably sound and irrevocable answers.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
