Abstract
Runtime commitment verification is an important,open issue in multiagent research. To address it, we build on Yolum and Singh’s formalization of com-mitment 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 sta-tus of commitments effectively, producing provably sound and irrevocable answers.