Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs

Authors:
Abhik Roychoudhury;K. Narayan Kumar;C. R. Ramakrishnan;I. V. Ramakrishnan
Affiliations:
-;-;-;-
Venue:
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Year:
1999

Citing 10
Cited 2

Formulation of induction formulas in verification of PROLOG programs

Proc. of the 8th international conference on Automated deduction
A method for specializing logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unfold/fold transformation of stratified programs

Theoretical Computer Science
A transformation system for deductive database modules with perfect model semantics

Theoretical Computer Science
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Journal of Symbolic Computation - Special issue on automatic programming
Reducing nondeterminism while specializing logic programs

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of Logic Programming

Foundations of Logic Programming
A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Unfold/Fold Transformations For Definite Clause Programs

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Logic Programming and Model Checking

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming

Program Derivation = Rules + Strategies

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Verification of Parameterized Systems Using Logic Program Transformations

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sato style folding using clauses from a previous program in the transformation sequence: i.e., they fold using a single, non-recursive clause. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various semantics of negation including the well-founded model and stable model semantics.