On the Equivalence between the \(\mathcal{L}_1\) Action Language and Partial Actions in Transaction Logic

  • Martín Rezk
  • Michael Kifer
Conference paper

DOI: 10.1007/978-3-642-23580-1_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6902)
Cite this paper as:
Rezk M., Kifer M. (2011) On the Equivalence between the \(\mathcal{L}_1\) Action Language and Partial Actions in Transaction Logic. In: Rudolph S., Gutierrez C. (eds) Web Reasoning and Rule Systems. RR 2011. Lecture Notes in Computer Science, vol 6902. Springer, Berlin, Heidelberg

Abstract

Transaction Logic with Partially Defined Actions (TRPAD) is an expressive formalism for reasoning about the effects of actions and for declarative specification of state-changing transactions. The action language \(\mathcal{L}_1\) is a well-known formalism to describe changing domains and for reasoning about actions. The purpose of this paper is to compare these two formalisms and identify their similarities and points of divergence in order to better understand their modeling and reasoning capabilities. We provide a sound reduction of a large fragment of \(\mathcal{L}_1\) to TRPAD, and show that this reduction is complete with respect to the LP embedding of \(\mathcal{L}_1\). We also explore how action planning is modeled in both languages and discuss the relationship to other languages for representing actions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Martín Rezk
    • 1
  • Michael Kifer
    • 2
  1. 1.KRDB Research CenterFree University of Bozen-BolzanoBolzanoItaly
  2. 2.Department of Computer ScienceStony Brook UniversityU.S.A.

Personalised recommendations