Transaction logic

From Wikipedia, the free encyclopedia

Transaction logic is an extension of predicate logic with both declarative and procedural semantics that describe state changes in logic programming over dynamic databases. First proposed in the early 1990s by Anthony J. Bonner and Michael Kifer, transaction logic allows for the amalgamation of features including hypothetical updating, nondeterminism, and artificial intelligence via behaviors of object-oriented databases.[1]

Bonner and Kifer have offered a proof of completeness for a Serial Horn program implementation of transaction logic.[2]

A prototype of transaction logic has been implemented in XSB Prolog.[3]

[edit] References

  • Bonner, Anthony J. and Michael Kifer (1995) Transaction logic programming, Computer Systems Research Institute Technical Report CSRI-323 (revision of CSRI-270 of 1992), University of Toronto.

[edit] Notes

  1. ^ Bonner and Kifer (1995), abstract
  2. ^ Bonner and Kifer (1995), "6. Proof Theory" and appendix E
  3. ^ ftp://ftp.cs.toronto.edu/pub/goku/transaction_logic/XSB/Prototype3/
 This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.