On the equivalence between the L1 action language and partial actions in transaction logic

Authors:
Martín Rezk;Michael Kifer
Affiliations:
KRDB Research Center, Free University of Bozen-Bolzano, Bolzano, Italy;Department of Computer Science, Stony Brook University, NY
Venue:
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Year:
2011

Citing 5
Cited 0

Logic programming with strong negation

Proceedings of the international workshop on Extensions of logic programming
A logic for programming database transactions

Logics for databases and information systems
An action language based on causal explanation: preliminary report

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Modular Action Language ${\cal ALM}$

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Formalization of HIPAA for a Medical Messaging System

TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business

Quantified Score

Hi-index	0.00

Visualization

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 L1 is a wellknown 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 L1 to TRPAD, and show that this reduction is complete with respect to the LP embedding of L1. We also explore how action planning is modeled in both languages and discuss the relationship to other languages for representing actions.