Unfold⧸fold transformation of general logic programs for the well-founded semantics
- 31 May 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 16 (1-2) , 5-23
- https://doi.org/10.1016/0743-1066(93)90021-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Unfold/fold transformation of stratified programsTheoretical Computer Science, 1991
- A procedural semantics for well founded negation in logic programsPublished by Association for Computing Machinery (ACM) ,1989
- Every logic program has a natural stratification and an iterated least fixed point modelPublished by Association for Computing Machinery (ACM) ,1989
- The alternating fixpoint of logic programs with negationPublished by Association for Computing Machinery (ACM) ,1989
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Equivalences of logic programsPublished by Springer Nature ,1986
- On the partial computation principleInformation Processing Letters, 1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977