Annals of Mathematics and Artificial Intelligence

, Volume 21, Issue 2, pp 245–303

Representing and reasoning about concurrent actions with abductive logic programs

  • Renwei Li
  • Luís Moniz Pereira

DOI: 10.1023/A:1018921603877

Cite this article as:
Li, R. & Pereira, L.M. Annals of Mathematics and Artificial Intelligence (1997) 21: 245. doi:10.1023/A:1018921603877


In this paper we extend Gelfond and Lifschitz' action description language 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 model-based 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.

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Renwei Li
    • 1
  • Luís Moniz Pereira
    • 1
  1. 1.Centro de Inteligência Artificial, Departamento de InformáticaUniversidade Nova de LisboaMonte da CaparicaPortugal