On the correctness of unfold/fold transformation of normal and extended logic programs
- 30 September 1995
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 24 (3) , 201-217
- https://doi.org/10.1016/0743-1066(94)00104-e
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A note on the stable model semantics for logic programsArtificial Intelligence, 1997
- The s-semantics approach: Theory and applicationsThe Journal of Logic Programming, 1994
- Transformation of logic programs: Foundations and techniquesThe Journal of Logic Programming, 1994
- Non-monotonic reasoning with logic programmingThe Journal of Logic Programming, 1993
- Commonsense axiomatizations for logic programsThe Journal of Logic Programming, 1993
- Basic transformation operations which preserve computed answer substitutions of logic programsThe Journal of Logic Programming, 1993
- Unfold⧸fold transformation of general logic programs for the well-founded semanticsThe Journal of Logic Programming, 1993
- Short note preferred extensions are partial stable modelsThe Journal of Logic Programming, 1992
- Unfold/fold transformations of logic programsMathematical Structures in Computer Science, 1992
- Derivation of Logic ProgramsJournal of the ACM, 1981