Paper Info
Title
Unfolding, procedural and fixpoint semantics of logic programs
Abstract
In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs. We introduce 3 main new ideas: –  the unfolding rule has an associativity property that ensures the adequacy of unfolding semantics with the procedural semantics –  the uniformly fair computation rules which guarantees strong procedural equivalences –  the notion of operator compatible with unfolding which provides the connection between the unfolding and fixpoint semantics and gives new tools for proving old and new results of equivalence between procedural and fixpoints semantics of logic programs.
Year
DOI
Venue
1991
10.1007/BFb0020825
JTASPEFT/WSA
Keywords
DocType
Volume
fixpoint semantics,logic program
Conference
480
ISBN
Citations 
PageRank 
0-387-53709-0
15
0.72
References 
Authors
10
2
Name
Order
Citations
PageRank
François Denis1150.72
Jean-Paul Delahaye232554.60