A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19-20:261--320, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Skeleton-based Agent Development for Electronic - Institutions Wamberto.. (Correct)
.... initial program is a skeleton and the re nements are techniques added to it [3, 4] Logic program development can thus be seen as a transformation activity [25, 29] in which legal operations on a program (adding techniques) must preserve desirable properties (such as, for instance, termination) [19]. 4.1 Prolog Programming via Skeletons and Techniques To illustrate the skeletons and techniques approach, using a particular form of logic programming, viz. Prolog [1] we show in Fig. 9 an example. In this example, an initial skeleton for a Prolog program, s=1, to traverse a list (left hand ....
M. Proietti and A. Pettorossi. Transformations of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19, 20:261-320, 1994.
Automatic Tupling for Functional-Logic Programs - Moreno (2002) (Correct)
....called tupling [20] but here we prefer to reserve this word for the global algorithm. calls to be tupled are not nested and they may be arbitrarily distributed in the right hand side of a rule. Sophisticated static analysis have been developed in the literature using dependencies graphs ([11, 19]) m dags ( 8] symbolic trace trees [9] and other intrincated structures. The main problems appearing in such approaches are that the analysis are not as general as wanted (they can fail even although the program admits tupling optimizations) they are time and space consuming and or they may ....
A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261--320, 1994.
Removing Redundant Arguments of Functions - Alpuente, Escobar, Lucas (2002) (1 citation) (Correct)
....have redundant arguments which are normal forms. Among the vast literature on analysis (and removal) of unnecessary data structures, the analyses of unneededness (or absence) of functional programming [9, 16] and the ltering of useless arguments and unnecessary variables of logic programming [25, 31] are the closest to our work. In [16] a notion of needed unneeded parameter for list manipulation programs is introduced which is closely related to the redundancy of ours in that it is capable of identifying whether the value of a subexpression is ignored. The method is formulated in terms of a ....
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. J. Logic Program. 19,20, 261-320.
Correction of Functional Logic Programs - Alpuente, Ballis, Correa, Falaschi (2003) (Correct)
....reasoning with the deductive process, so that the derived program is guaranteed to be correct. Unfortunately, it is known that the deductive process alone (i.e. unfolding) does not generally suce for coming up with the corrected program, and inductive generalization techniques are necessary [15, 34, 35]. In [23, 24, 20] a bottom up framework for synthesizing correct functional logic programs (w.r.t. the ground success set, Herbrand semantics) is presented which induces program rules from sets of equations which are respectively incorrect and correct w.r.t. the pursued program. Their ....
A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261-320, 1994. 16
Redundancy of Arguments Reduced to Induction - Alpuente, Echahed, Escobar, Lucas (2002) (Correct)
....The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. Examples are redundant arguments in the functions de ned in the program [1, 2, 7, 13, 15, 18, 20, 21, 24, 27]. Example 1. Consider the following program, which can be used for adding and substracting natural numbers in Peano s notation: minus(x,0) x plus(0,y) y minus(0,s(y) 0 plus(s(x) y) s(plus(x,y) minus(s(x) s(y) minus(x,y) Work partially supported by CICYT TIC2001 2705 C03 01, ....
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, pages 261-32, 1994.
Transformation Rules for Locally Stratified.. - Fioravanti.. (2004) (1 citation) Self-citation (Pettorossi Proietti) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19,20:261320, 1994.
A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19-20:261--320, 1994.
On the Semantics of Logic Program Composition - Antonio Brogi Department (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformations of logic programs: Foundations and techniques. Journal of Logic Programming, 19 & 20:261--320, 1994.
Safe Folding/Unfolding with Conditional Narrowing - Alpuente, Falaschi, Moreno.. (1997) (2 citations) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261--320, 1994.
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformations of Logic Programs: Foundations and Techniques. Journal of Logic Programming, Special Issue: Ten Years of Logic Programming, 19/20, May/July 1994.
Rules + Strategies for Transforming Lazy Functional.. - Alpuente, Falaschi.. (2004) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261--320, 1994.
Refactoring Prolog Programs - Schrijvers, Serebrenik, Demoen (2001) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19/20:261--320, May/July 1994.
Removing Redundant Arguments Automatically - M.Alpuente, S.Escobar, S.Lucas (2004) (Correct)
No context found.
Pettorossi, A. and Proietti, M. 1994. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming 19,20, 261--320.
Improving Prolog Programs: Refactoring for Prolog - Schrijvers, Serebrenik (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19/20:261--320, May/July 1994.
Project Report on: - Lp Second Generation (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: foundations and techniques. Journal of Logic Programming, 19 & 20:261-320, May 1994.
Development of Correct Transformation - Schemata For Prolog (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19/20:261--320, 1994.
A Class of Rewriting Rules and Reverse Transformation.. - Akama.. (2001) (1 citation) (Correct)
No context found.
Pettorossi, K. and Proietti, M., Transformation of Logic Programs: Foundations and Techniques, Journal of Logic Programming 19/20 (1994), pp. 261--320.
Equivalent Transformation - Of (Correct)
No context found.
Pettorossi, A. and Proietti, M., Transformation of Logic Programs: Foundations and Techniques, The Journal of Logic Programming,Vol.19/20, 1994,pp.269
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19& 20:261-320, May 1994.
Folding by Similarity - Galan, Canete (Correct)
No context found.
Pettorossi, A., Proietti, M. Transformation of Logic Programs: Foundations and Techniques. J. Logic Programming 1994:19, 20: 261-320.
Refactoring Prolog Code - Schrijvers, Serebrenik, Demoen (2004) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19/20:261--320, May/July 1994.
Argumentation-Theoretic Proof Procedures for Default Reasoning - Dung, Kowalski, Toni (2003) (1 citation) (Correct)
No context found.
A. Pettorossi, M. Proietti, Transformation of logic programs: foundations and techniques. Journal of Logic Programming 19/20, 1994, pages 261--320
Generalized Generalization Generalizers (Extended Abstract) - Büyükyildiz, Flener (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs: foundations and techniques. Journal of Logic Programming, 19(20):261--320, 1994.
A Safe Transformation System for Optimizing Functional Programs - Moreno (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19,20:261--320, 1994.
Linearisability on Datalog Programs - Foto Afrati Manolis (2002) (Correct)
No context found.
A. Pettorossi and M. Proietti. Transformation of logic programs : Foundations and techniques. The Journal of Logic Programming, 19/20:261--320, May/July 1994.
First 50 documents Next 50
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