(Enter summary)
Abstract: We present a method for proving properties of definite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules... (Update)
Context of citations to this paper: More
...automate the deduction involved. The idea of using logic program transformations for proving goal equivalences was rst explored in [PP99] for logic program synthesis. Our work expands the existing body of work in logic program transformations with more powerful...
...the transformation of a program P 1 into a program P 2 is also a proof of the equivalence of P 1 and P 2 w.r.t. that semantics. In [54] this idea has also been developed in the case of de nite logic programs. The method presented in that paper, called unfold fold proof...
Cited by: More
Transformation Rules for Locally Stratified.. - Fioravanti.. (2004)
(Correct)
Rules and Strategies for Contextual Specialization of.. - Fioravanti (2000)
(Correct)
Program Derivation = Rules + Strategies - Pettorossi, Proietti (2001)
(Correct)
Similar documents (at the sentence level):
57.5%: Synthesis And Transformation Of Logic Programs Using.. - Pettorossi, Proietti (1997)
(Correct)
32.1%: Automatic Derivation of Logic Programs by Transformation - Pettorossi, Proietti (2000)
(Correct)
Active bibliography (related documents): More All
0.8: Transformation of Logic Programs - Pettorossi, Proietti (1998)
(Correct)
0.6: A Generalized Unfold/Fold Transformation System.. - Roychoudhury..
(Correct)
0.5: Program Transformations for Automated Verification of.. - Roychoudhury (1999)
(Correct)
Similar documents based on text: More All
1.9: Verification of Sets of Infinite State Processes.. - Fioravanti.. (2001)
(Correct)
1.8: Verifying CTL Properties of Infinite State Systems.. - Fioravanti.. (2001)
(Correct)
1.0: Combining Logic Programs and Monadic Second Order.. - Fioravanti..
(Correct)
Related documents from co-citation: More All
8: Foundations of Logic Programming (context) - Lloyd - 1987
7: Model Checking in CLP
- Delzanno, Podelski - 1999
6: Theoretical Computer Science (context) - Etalle, Gabbrielli et al. - 1996
BibTeX entry: (Update)
A. Pettorossi and M. Proietti. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programming, 41, 1999. http://citeseer.ist.psu.edu/pettorossi99synthesis.html More
@article{ pettorossi99synthesis,
author = "Alberto Pettorossi and Maurizio Proietti",
title = "Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs",
journal = "Journal of Logic Programming",
volume = "41",
number = "2--3",
pages = "197--230",
year = "1999",
url = "citeseer.ist.psu.edu/pettorossi99synthesis.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
385
A transformation system for developing recursive programs
- Burstall, Darlington - 1977
224
Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
212
Abductive logic programming
- Kakas, Kowalski et al. - 1992
139
fold transformation of logic programs (context) - Tamaki, Sato - 1984
129
Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
94
A deductive approach to program synthesis (context) - Manna, Waldinger - 1980
57
The concept of a supercompiler (context) - Turchin - 1986
51
Automatic mode inference for logic programs
- Debray, Warren - 1988
50
Derivation of logic programs (context) - Hogger - 1981
32
ACM Transactions on Programming Languages and Systems (context) - Bossi, Cocco et al. - 1990
30
The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
30
Reducing nondeterminism while specializing logic programs
- Pettorossi, Proietti et al. - 1997
28
Logic program synthesis
- Deville, Lau - 1994
26
Correctness of a logic program transformation system (context) - Maher - 1987
23
Extracting logic programs from proofs that use extended Prol.. (context) - Fribourg - 1990
22
Preserving universal termination through unfold/fold (context) - Bossi, Cocco - 1994
15
Proofs as programs (context) - Bates, Constable - 1985
14
A generalized correctness proof of the unfold/fold logic pro.. (context) - Tamaki, Sato - 1986
13
Program transformation by data structure mapping (context) - Hansson, arnlund
12
Grammar-related transformations of logic programs (context) - Brough, Hogger - 1991
12
fold transformations of logic programs using extended OLDT-b.. (context) - Boulanger, Bruynooghe - 1993
12
Synthesis of programs from unfold/fold proofs (context) - Proietti, Pettorossi - 1994
12
Deletion of redundant unary type predicates from logic progr.. (context) - Gallagher, de Waal
5
The McCarthy's induction principle: `oldy' but `goody (context) - Kott - 1982
3
A rst order theory of data and programs (context) - Clark, arnlund - 1977
3
fold transformations for denite clause programs (context) - Gergatsoulis, Katzouraki - 1994
3
list transformation algorithm for Prolog programs (context) - Zhang - 1987
2
Journal of Logic Programming (context) - Bruynooghe, De Schreye et al. - 1989
1
Derivation of logic programs from implicit denition (context) - Kanamori, Maeji - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iasi.rm.cnr.it/~proietti/reports.html): More
Program Specialization via Algorithmic Unfold/Fold.. - Pettorossi, Proietti (1998)
(Correct)
Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996)
(Correct)
Future Directions in Program Transformation - Pettorossi, Proietti
(Correct)
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