Unfold/fold transformation of stratified programs (Q1177929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem for SLDNF resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfold/fold transformations of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preservation of stronger equivalence in unfold/fold logic program transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closures and fairness in the semantics of programming logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90007-o / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975952423 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Unfold/fold transformation of stratified programs
scientific article

    Statements

    Unfold/fold transformation of stratified programs (English)
    0 references
    0 references
    26 June 1992
    0 references
    One of the most important properties of program transformation is equivalence preservation. In \textit{H. Tamaki} and \textit{T. Sato} [Unfold/fold transformation of logic programs, Proc. 2nd Int. Logic Programming Conf., 127-138 (1984)]\ a framework for transformation of logic programs was proposed. The author describes an extended unfold/fold transformation preserving (in addition to the success set) the finite failure set and allowing its further extension to stratified programs. It is proved that in the case of stratified programs both the success set and the finite failure set are preserved. In the appendix also the preservation of perfect model semantics is proved.
    0 references
    perfect model semantics
    0 references
    unfold/fold transformation
    0 references
    finite failure set
    0 references

    Identifiers