A generalization of the folding rule for the Clark-Kunen semantics

Authors:
Javier Álvez;Paqui Lucio
Affiliations:
Basque Country University;Basque Country University
Venue:
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Year:
2008

Citing 14
Cited 0

Negation in logic programming

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Equational problems anddisunification

Journal of Symbolic Computation
A transformational approach to negation in logic programming

Journal of Logic Programming
Logic programming

Handbook of theoretical computer science (vol. B)
Unfold/fold transformation of stratified programs

Theoretical Computer Science
Equivalence-preserving first-order unfold/fold transformation systems

Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
A transformation system for deductive database modules with perfect model semantics

Theoretical Computer Science
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Unfold/Fold Transformations For Definite Clause Programs

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics

LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Constructive negation by bottom-up computation of literal answers

Proceedings of the 2004 ACM symposium on Applied computing
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. Our generalized folding rule enables new transformation sequences that, in particular, are suitable for recursion introduction and local variable elimination. We provide some illustrative examples and give a detailed proof of correctness w.r.t. the Clark-Kunen semantics.