A unified semantics for constraint handling rules in transaction logic

Authors:
Marc Meister;Khalil Djelloul;Jacques Robin
Affiliations:
Fakultät für Ingenieurwissenschaften und Informatik, Universität Ulm, Germany;Fakultät für Ingenieurwissenschaften und Informatik, Universität Ulm, Germany;Centro de Informática, Universidade Federal de Pernambuco, Recife, PE, Brazil
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 6
Cited 2

A logic for programming database transactions

Logics for databases and information systems
Confluence and Semantics of Constraint Simplification Rules

Constraints
Results on Reasoning about Updates in Transaction Logic

ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
FLUX: A logic programming method for reasoning agents

Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules

Theory and Practice of Logic Programming
Nonmonotonic reasoning in FLORA-2

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

A compositional semantics for CHR

ACM Transactions on Computational Logic (TOCL)
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reasoning on Constraint Handling Rules (CHR) programs and their executional behaviour is often ad-hoc and outside of a formal system. This is a pity, because CHR subsumes a wide range of important automated reasoning services. Mapping CHR to Transaction Logic (τ R) combines CHR rule specification, CHR rule application, and reasoning on CHR programs and CHR derivations inside one formal system which is executable. This new τ R semantics obviates the need for disjoint declarative and operational semantics.