(Enter summary)
Abstract: We give a proof-theoretic analysis of logic programs transformations,
viewed as operations on proof trees in the sense of [3, 4, 9, 10].
We present a logic for reasoning about (equivalence preserving) transformations
of logic programs. Our main tool is the usage of inference rules;
the target program may be obtained as a set of clause introduction proofs
with axioms from the source program. The rules are admissible, that is
every proof according to the latter can be translated back in a... (Update)
Active bibliography (related documents): More All
0.3: Regular Search Spaces and Constructive Negation - Momigliano, Ornaghi (1997)
(Correct)
0.3: A Formal Framework for Synthesis and Verification of.. - Avellone, Ferrari.. (2000)
(Correct)
0.2: Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002)
(Correct)
Similar documents based on text: More All
0.3: OOD Frameworks in Component-based Software Development in.. - Lau, Ornaghi (1998)
(Correct)
0.3: On Dynamic Aspects of OOD Frameworks in Component-based .. - Filipe, Lau, Ornaghi.. (1999)
(Correct)
0.3: On Specification and Correctness of OOD Frameworks in.. - Lau, Ornaghi (1998)
(Correct)
BibTeX entry: (Update)
@article{ momigliano98towards,
author = "Alberto Momigliano and Mario Ornaghi",
title = "Towards a Logic for Reasoning About Logic Programs Transformation",
journal = "Lecture Notes in Computer Science",
volume = "1463",
pages = "226--??",
year = "1998",
url = "citeseer.ist.psu.edu/493641.html" }
Citations (may not include all citations):
224
Partial Evaluation in Logic Programming (context) - Lloyd, Shepherdson - 1991 ACM DBLP
192
Logic Programming (context) - Apt - 1990 ACM DBLP
129
Transformation of Logic Programs: Foundations and Techniques (context) - Pettorossi, Proietti - 1994 DBLP
62
UnfoldFold Transformation Logic Program (context) - Fold, Logic et al. - 1992
62
UnfoldFold Transformation Logic Program (context) - Unfold, of et al. - 1984
58
A Proof-Theoretical Study (context) - Prawitz - 1965
56
An Introduction to Partial Evaluation (context) - Jones - 1996 ACM DBLP
47
An Automatic Partial Evaluator for Full Prolog
- Sahlin - 1991
39
A Proof-theoretic Approach to Logic Programming: Clauses as .. (context) - Hallnas, Schroeder-Heister - 1990
24
Logical Features of Horn Clauses (context) - Hodges - 1993 ACM
22
Rules of definitional reflection (context) - Schroeder-Heister - 1993 DBLP
9
UnfoldFold Transformation Stratified Program (context) - Fold, Stratified et al. - 1991
4
International Seminar (context) - Danvy, Gluck et al. - 1996
4
Special Issue on Partial Deduction (context) - Komorowski - 1993
3
Regular Search Spaces as a Foundation of Logic Programming (context) - Momigliano, Ornaghi ACM DBLP
1
Regular Search Spaces and Constructive Negation
- Momigliano, Ornaghi - 1997 DBLP
1
Annales Societatis Mathematicae Polonae (context) - Komorowski - 1993
Documents on the same site (http://www.mcs.le.ac.uk/~amomigliano/): More
A Step-to-Step Example of Negation Elimination in Hereditary.. - Momigliano
(Correct)
Elimination of Negation in a Logical Framework - Momigliano
(Correct)
Higher-Order Pattern Complement and the Strict ...-Calculus - Momigliano, Pfenning
(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