Representing and reasoning about concurrent actions with abductive logic programs

Abstract

In this paper we extend Gelfond and Lifschitz’ action description language {\cal A} with concurrent actions and observation propositions to describe the predicted behaviour of domains of (concurrent) actions and actually observed behaviour, respectively, without requiring that the actually observed behaviour of a domain of actions be consistent with its predicted behaviour. We present a translation from domain descriptions and observations in the new action language to abductive normal logic programs. The translation is shown to be both sound and complete. From the standpoint of modeldbased diagnosis, in particular, we discuss the temporal explanation of inferring actions from fluent changes at two different levels, namely, at the domain description level and at the abductive logic programming level. The method is applicable to the temporal projection problem with incomplete information, as well as to the temporal explanation of inferring actions from fluent changes.