Unfold/fold transformations for disjunctive logic programs

DOI10.1016/S0020-0190(97)00038-0zbMath1336.68028OpenAlexW2060632369MaRDI QIDQ287026

Manolis Gergatsoulis

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00038-0

zbMATH Keywords

program transformationsdisjunctive logic programspartial deductionprogramming calculi

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Partial evaluation in logic programming
• Transformation of logic programs: Foundations and techniques
• Characterizations of the stable semantics by partial evaluation
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Basic transformation operations which preserve computed answer substitutions of logic programs
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• The Specialization of Programs by Theorem Proving

This page was built for publication: Unfold/fold transformations for disjunctive logic programs