Concurrency and Communication in Transaction Logic


In previous work, we developed Transaction Logic (or T R), which deals with state changes in deductive databases. T R provides a logical framework in which elementary database updates and queries can be combined into complex database transactions. T R accounts not only for the updates themselves, but also for important related problems, such as the order of update operations, non-determinism, and transaction failure and rollback. In the present paper, we propose Concurrent Transaction Logic (or CT R), which extends Transaction Logic with connectives for modeling the concurrent execution of complex processes. Concurrent processes in CT R execute in an interleaved fashion and can communicate and synchronize themselves. Like classical logic, CT R has a \Horn" fragment that has both a procedural and a declarative semantics, in which users can program and execute database transactions. CT R is thus a deductive database language that integrates concurrency, communication, and updates. All this is accomplished in a completely logical framework, including a natural model theory and a proof theory. Moreover, this framework is exible enough to accommodate many di erent semantics for updates and deductive databases. For instance, not only can updates insert and delete tuples, they can also insert and delete null values, rules, or arbitrary logical formulas. Likewise, not only can databases have a classical semantics, they can also have the well-founded semantics, the stable-model semantics, etc. Finally, the proof theory for CT R has an e cient SLD-style proof procedure. As in the sequential version of the logic, this proof procedure not only nds proofs, it also executes concurrent transactions, nds their execution schedules, and updates the database. A main result is that the proof theory is sound and complete for the model theory. Appears in Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), September 2{6 1996 Bonn, Germany, pages 142{156. MIT Press. This and related papers and software are available at the following web page: Work supported in part by an Operating Grant from the Natural Sciences and Engineering Research Council of Canada. Supported in part by the NSF Grant IRI-9404629.

Extracted Key Phrases

2 Figures and Tables


Citations per Year

152 Citations

Semantic Scholar estimates that this publication has 152 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Bonner1996ConcurrencyAC, title={Concurrency and Communication in Transaction Logic}, author={Anthony J. Bonner and Michael Kifer}, booktitle={JICSLP}, year={1996} }