Paper Info
Title
On the correctness of unfold/fold transformation of normal and extended logic programs
Abstract
We show that the framework for unfold/fold transformation of logic programs, first proposed by Tamaki and Sato and later extended by various researchers, preserves various nonmonotonic semantics of normal logic programs, especially preferred extension, partial stable models, regular model, and stable theory semantics. The primary aim of this research is to adopt a uniform approach for every semantics of normal programs, and that is elegantly achieved through the notion of semantic kernel. Later, we show that this framework can also be applied to extended logic programs, preserving the answer set semantics.
Year
DOI
Venue
1995
10.1016/0743-1066(94)00104-E
The Journal of Logic Programming
Field
DocType
Volume
Discrete mathematics,Program transformation,Programming language,Axiomatic semantics,Correctness,Automated theorem proving,Algorithm,Circumscription,Stable model semantics,Well-founded semantics,Higher-order logic,Mathematics
Journal
24
Issue
ISSN
Citations 
3
0743-1066
28
PageRank 
References 
Authors
1.10
39
2
Name
Order
Citations
PageRank
Chandrabose Aravindan113723.13
P. M. Dung269434.87