Reasoning with Actions in Transaction Logic

  • Martín Rezk
  • Michael Kifer
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6902)
Cite this paper as:
Rezk M., Kifer M. (2011) Reasoning with 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

This paper introduces TRPAD (Transaction Logic with Partially Defined Actions)—an expressive formalism for reasoning about the effects of compound actions. TRPAD is based on a subset of Transaction Logic, but extends it with special premise-formulas that generalize the data and transition formulas of the original Transaction Logic. We develop a sound and complete proof theory for TRPAD and illustrate the formalism on a number of non-trivial examples. In addition, we show that most of TRPAD is reducible to ordinary logic programming and that this reduction is sound and complete.

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