D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction|CADE-12, pages 207-221. Springer-Verlag, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... and of code and search explosion, and efficiency gains have been obtained [17, 27, 21] Several fully automated systems (sp, sage, paddy, mixtus, ecce) as well as semi automated ones (logimix, leupel, logen) have been developed and successfully applied to at least medium size applications [25, 15]. 1 Another recent line of research has focussed on overcoming some of the inherent limitations of partial evaluation, 24] 26, 14] 23, 22] integrating ideas from constraint logic programming, unfold fold program transformation, and abstract interpretation respectively while keeping the ....

D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction---CADE-12, pages 207--221. Springer-Verlag, 1994.

....but in this paper we are concerned with deriving such descriptions statically, rather than prescribing them. Derivation of set expressions such as these has many applications including type inference [16, 8] debugging [24] assisting compiler optimisations [25, 34] optimising a theorem prover [14], program specialisation [20] planning [4] and veri cation [8] The rst work in this area was by Reynolds [33] other early research was done by Jones and Muchnick [27, 26] In the past decade two di erent approaches to deriving set expressions have been followed. One approach is based on ....

D. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, 1994.

....use built in heuristics to make their decisions, others control the specialisation process solely by observing characteristics of the program to be specialised. Partial deduction (and partial evaluation in general) has been applied to a lot of application domains, such as theorem proving (e.g. dG94] deductive databases (e.g. LD98] and compiler generation (e.g. JGS93] Perhaps the most noteworthy application domain of partial deduction is the specialisation of metainterpreters [LS90, SB89] Specialising a metainterpreter with respect to an object program thus removing the ....

D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Proceedings CADE-12, volume 814 of Lecture Notes in Articial Intelligence, pages 207-221, Nancy, France, June/July 1994. Springer-Verlag.

....but in this paper we are concerned with deriving such descriptions statically, rather than prescribing them. Derivation of set expressions such as these has many applications including type inference [13, 6] debugging [21] assisting compiler optimisations [22, 32] optimising a theorem prover [11], program specialisation [17] planning [3] and veri cation [6] The rst work in this area was by Reynolds [30] other early research was done by Jones and Muchnick [24, 23] In the past decade two di erent approaches to deriving set expressions have been followed. One approach is based on ....

D. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, 1994.

....it loops even in case of finite action sequences. In this paper we propose elegant solutions to these two problems, detecting unsolvable planning problems and postdiction, based on logic program analysis and transformation. The solutions are based on the approach by de Waal and Gallagher [3, 2]. In their approach a proof procedure for some logic is specialized with respect to a specific theorem proving problem. The result of the specialization process is an optimized proof procedure that can only prove formulas in the given theorem proving problem. One of the e#ects of the ....

....of a possible infinite number of resources. However, we have found that the procedure suggested in [2] is not precise enough for the optimization of this logic program and needs improvement. The first problem sketched above may be solved by refining the specialization procedures developed in [3, 2]. Nonetheless it is not feasible to give an exact solution to the second problem as we pointed out earlier. An approximation of the resources needed is therefore computed. The layout of the rest of the paper is as follows. In the next section we introduce deductive planning problems. Furthermore, ....

[Article contains additional citation context not shown here]

D.A. de Waal and J.P. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction--- CADE-12, pages 207--221. Springer-Verlag, 1994.

No context found.

D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction|CADE-12, pages 207-221. Springer-Verlag, 1994.

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