Anthony J. Bonner and Michael Kifer, Transaction Logic Programming. Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, April 1995. [BK95]  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Prolog. Instead, there is a general rule defining key=2 in terms of its tags: key(X; N ) Gamma i key(X; N ) not(d key(X; N ) 4. 26) So, with the above declaration, the atom p(1; 1) is stored as i key(p(1) 2) val(p(1) 1] 2) in database, and p(2; 2) is stored as i key(p(2) 2) val(p(2) [2]; 2) in database. In Prolog, if the indexed argument is a predicate, then the name of the predicate is used for indexing. So, Prolog indexes the key on the predicate name, which is almost equivalent to no indexing because tuples are exhaustively searched in access time. For this reason, access ....

....case reduces the search time of the tuple but, of course, such optimization has no effect if the key a proper subset of the arguments, such as the above example for p=2 key 1. For instance, consider the above example. To insert p(1; 2) into database, in Prototype 1, i key(p(1) 2) and value(p(1) [2]; 2) are inserted into database. These two base predicates are easily generated by decomposing p(1; 2) into p(1) and [2] which are stored as the arguments of two general predicates, i key=2 and value=3. In Prototype 2, with the same update, two predicates i key 2 p(1) and value 2 p(1; 2) are ....

[Article contains additional citation context not shown here]

Anthony J. Bonner and Michael Kifer, Transaction Logic Programming. Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, April 1995. [BK95]

....in [2] have a procedural semantics which is defined by a bottom up evaluation and which does not coincide with model based semantics known from the area of logic programming. 14, 15] use dynamic logic to define semantics of updates but also rely on a certain evaluation strategy (top down) [4] propose Transaction Logic, a very general and powerful framework for numerous phenomenons of state change including database updates and planning and consequently leave the standard framework of logic programming. In contrast, we have presented a minimal extension of Datalog which is sufficient ....

A. J. Bonner and M. Kifer. Transaction logic programming. Technical Report CSRI270, Computer Systems Research Institute, University of Toronto, 1993.

....basis of a realistic (prototype) implementation, as LDL can be efficiently executed by means of a fixpoint procedure with real side effects to support updates. The static component of the considered object model, i.e. its data definition and query language, can be seen as a fragment of F logic [BK93], and provides mechanisms for multiple inheritance, multiple roles, virtual objects, views, and methods (derived attributes) The dynamic component of the considered object model, i.e. the basic update and object migration operations, is inspired by the analogous features of the Fibonacci language ....

....a notion of object identifier is modeled by way of existential quantification. As far as the dynamic aspects are concerned, there are proposals which provide a procedural semantics, as in the case of [Mon93, BGM95] and other proposals provide adhoc model theoretic semantics related to modal logic [BK93, MW86, Man89, Che91]. In the former case, a poor integration of the various aspects is achieved, whereas in the latter a close relationship to real computing is missing. Moreover, it is difficult to combine the structural and dynamic aspects of the object data model with deduction. For instance, the F logic combined ....

A. J. Bonner and M. Kifer. Transaction Logic Programming. Technical Report CSRI-270, Computer System Research Institute, University of Toronto, December 1993.

....work by instantiating a program implementation pattern associated to each sort of component. The parameters serve as an interface to the operation generation process. The resulting instantiated operation is a CGI program. For example, the de nition: query(pubs by year, publication, 4] [1,2,3,5]) corresponds to a query operation, called pubs by year, that performs a query on the predicate publication. The query returns values corresponding to the arguments positions [1,2,3,5] Argument of position 4 is given as input parameter. The following code correspond to the CGI program (in ....

....instantiated operation is a CGI program. For example, the de nition: query(pubs by year, publication, 4] 1,2,3,5] corresponds to a query operation, called pubs by year, that performs a query on the predicate publication. The query returns values corresponding to the arguments positions [1,2,3,5]. Argument of position 4 is given as input parameter. The following code correspond to the CGI program (in Prolog) corresponding to this operation: main : get form input(F) get form value(F, year, Y) pubs by year(Y,PubList) show page(PubList) pubs by year(Y, PubList) ndall( T, A, ....

[Article contains additional citation context not shown here]

Bonner, A.J. and Kifer, M. Transaction Logic Programming. Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto. November, 1995.

....through action formalisms. As a result, in order to subdue the frame problem, most logics require a large number of complex formulae to completely describe even a simple action. It is reasonable to admit that the gap originates from this axiomatization process. Using transaction logic (T R) [3] as the planning specification tool, we adopt an orthogonal approach to the action effects axiomatization. Instead of focusing on the axiomatization process, we center on the specification and execution of complex actions. We argue that in many common applications the frame problem is not an ....

....problem is not an issue. A reasonable support to this proposition are the practical applied researches developed so far. In these practical situations, elementary actions are usually specified procedurally; the hard work is to combine them in a suitable way. As clearly presented by Bonner Kifer [3, 2], T R fulfills exactly this lack by providing a suitable logical tool to combine actions. Once the frame problem is solved for elementary actions (via oracles 4 ) the solution is propagated to complex actions. Therefore, to address the plans are programs paradigm using T R, we firstly define a ....

[Article contains additional citation context not shown here]

A.J. Bonner and M. Kifer. Transaction logic programming. Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, 1993.

....(ADOOD) thus accomplishing at the same time the tasks of illustrating the expressiveness of Datalog , and providing a higher level programming front end to it. The static component of the considered object model, i.e. its data definition and query language, can be seen as a fragment of F logic [6], and provides mechanisms for multiple inheritance, multiple roles, virtual objects, views, and methods (derived attributes) The dynamic component of the considered object model, i.e. the basic update and object migration operations, is inspired by the analogous features of the Fibonacci language ....

....of F logic [13] in which a model theoretic semantics is given in terms of frame structures. As far as the dynamic aspects are concerned, there are proposals which provide a procedural semantics, as in the case of [5] and other proposals provide a model theoretic semantics related to modal logic [6, 16]. In either cases, static and dynamic aspects are dealt with separate frameworks. On the contrary, we argue in this paper that Datalog provides a flexible uniform framework, and moreover enables us to handle sophisticated dynamic features, such as roledynamics and object migration, widely ....

A. J. Bonner and M. Kifer. Transaction Logic Programming. Technical Report CSRI-270, Computer System Research Institute, University of Toronto, December 1993.

....way. A first class of proposals tackle only static (structural) aspects. This is the case, for example, of LOGIN [4] or of its extension F logic [12] As far as the dynamic aspects are concerned, there are various proposals, which provide a procedural or declarative semantics, as in the case of [16, 7, 8]. In either cases, static and dynamic aspects are dealt with in separate frameworks. On the contrary, we argue in [10] that Datalog provides a flexible uniform framework, and moreover enables us to handle sophisticated dynamic features, such as roledynamics and object migration, widely ....

A. J. Bonner and M. Kifer. Transaction Logic Programming. Technical Report CSRI-270, Computer System Research Institute, University of Toronto, December 1993.

....are also provided for. A major advantage of [10] is that it develops a sound and complete proof theory of the Horn fragment of T R which is suitable for Logic Programming. It turned out that it is awkward to formulate the proof theory of full T R in T R itself, so a general logic of state change [11] is being designed for this purpose. The proof theory can both reason about transaction execution and actually perform this execution. Two dual proof systems are presented, for normal execution and for reverse execution (it is assumed that for every elementary update the transition base, given ....

A. Bonner and M. Kifer. A general logic of state change. Technical report, Computer Systems Research Institute, University of Toronto, 1994. In preparation.

....After all, databases (as opposed to logic programs) have an inherently mutable state. A survey of this problem would require another paper. It suffices to say here that I believe the most promising approach is that proposed recently by Bonner and Kifer in their work on Transaction Logic [7]. This logic provides a simple, powerful language for expressing transactions and provides a logical semantics for it based not surprisingly on sequences of states. Each state is a set of databases, described by a first order formula, and this generality allows nondeterministic transactions to be ....

A. Bonner and M. Kifer. Transaction logic programming. Technical Report CSRI-270, Computer Systems Research Institute, University of Toronto, 1993. Shorter version appeared in Proc. Int. Conf. on Logic Programming, Budapest, 1993.

No context found.

A.J. Bonner and M. Kifer. Transaction logic programming (or, a logic of procedural and declarative knowledge). Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, November 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC