Abstract
A greatest fixed point characterization of the minimal infinite objects computed by a nonterminating logic program is presented, avoiding difficulties experienced by other attempts in the literature. A minimal infinite object is included in the denotation just when (1) it is successively finitely approximated by a fair infinite computation of the program and (2) any nonterminating computation which continually approximates this object in fact constructs it. Minimal objects are the most general constructible by nonterminating computations of the program.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.