Unfold⧸fold transformation of general logic programs for the well-founded semantics

DOI10.1016/0743-1066(93)90021-8zbMath0776.68031OpenAlexW1995270677MaRDI QIDQ5286915

Hirohisa Seki

Publication date: 25 August 1993

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(93)90021-8

zbMATH Keywords

well-founded semanticsequivalence of programsunfold/fold transformation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Unfold/fold transformations for disjunctive logic programs ⋮ Linearisability on Datalog programs ⋮ Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Determinization of conditional term rewriting systems ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Transformations of CLP modules