Name
Abstract | ||
|---|---|---|
This paper presents an overview of Transaction Logic —a new formalism recently introduced in Bonner and Kifer (1992, 1993) and designed to deal with the phenomenon of state changes in logic programming, databases, and AI. Transaction Logic has a natural model theory and a sound and complete proof theory. Unlike many other logics, however, it is suitable for programming procedures that accomplish state transitions in a logically sound manner. Transaction logic amalgamates such features as hypothetical and committed updates, dynamic constraints on transaction execution, nondeterminism, and bulk updates. Transaction Logic also appears to be suitable as a logical model of hitherto nonlogical phenomena, including so-called procedural knowledge in AI, and the behavior of object-oriented databases, especially methods with side effects. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0304-3975(94)90190-2 | Theor. Comput. Sci. |
Keywords | Field | DocType |
transaction logic | Transaction logic,Discrete mathematics,Theoretical computer science,Mathematics | Journal |
Volume | Issue | ISSN |
133 | 2 | Theoretical Computer Science |
Citations | PageRank | References |
75 | 8.59 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony J. Bonner | 1 | 733 | 422.63 |
| Michael Kifer | 2 | 3980 | 950.22 |