On the correctness of unfold/fold transformation of normal and extended logic programs

DOI10.1016/0743-1066(94)00104-EzbMATH Open0866.68018OpenAlexW2013815977MaRDI QIDQ3125899FDOQ3125899

Authors: Chandrabose Aravindan, Phan Minh Dung 

Publication date: 20 July 1997

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

Full work available at URL: https://doi.org/10.1016/0743-1066(94)00104-e

Recommendations

• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• Unfold/fold transformation of stratified programs
• Preservation of stronger equivalence in unfold/fold logic program transformation

zbMATH Keywords

logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (15)

• A unifying view for logic programming with non-monotonic reasoning
• Transformation-based bottom-up computation of the well-founded model
• A selective semantics for logic programs with preferences
• Some (in)translatability results for normal logic programs and propositional theories
• Ordering default theories and nonmonotonic logic programs
• A Generalization of the Folding Rule for the Clark-Kunen Semantics
• On inductive proofs by extended unfold/fold transformation rules
• An equivalence preserving first order unfold/fold transformation system
• Alan: An action language for modelling non-Markovian domains
• S-semantics for logic programming: a retrospective look
• On acceptance conditions in abstract argumentation frameworks
• Annotated defeasible logic
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• On Negative Unfolding in the Answer Set Semantics
• Oscillating behavior of logic programs

This page was built for publication: On the correctness of unfold/fold transformation of normal and extended logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125899)