On Inductive Proofs by Extended Unfold/Fold Transformation Rules

DOI10.1007/978-3-642-20551-4_8zbMath1326.68062OpenAlexW1504235253MaRDI QIDQ3003489

Hirohisa Seki

Publication date: 27 May 2011

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20551-4_8

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• On the declarative and procedural semantics of logic programs
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• On the correctness of unfold/fold transformation of normal and extended logic programs
• Deciding Full Branching Time Logic by Program Transformation
• On Inductive and Coinductive Proofs via Unfold/Fold Transformations
• On Negative Unfolding in the Answer Set Semantics
• Transformation of logic programs: Foundations and techniques
• Program Development in Computational Logic

This page was built for publication: On Inductive Proofs by Extended Unfold/Fold Transformation Rules