Abstract
The well-founded semantics for normal logic programs is regarded as a constructive approximation of stable models. The construction is based on the consequence operator for definite programs in cooperation with the Gelfond-Lifschitz transformation. It is first shown that a well-founded approximation for disjunctive programs can be defined in quite the same way. It is then demonstrated that knowledge compilation — originally introduced as an approximative evaluation procedure for classical propositional logic — can be naturally combined with the well-founded construction. It is thereby possible to evaluate queries on a disjunctive program by a reduction to the more efficient well-founded semantics of normal programs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
