Abstract
We introduce a generalized definition of SLD-resolution admitting restrictions on atom and/or clause selectability. Instances of these restrictions include delay declarations, input-consuming unification and guarded clauses. In the context of such a generalization of SLD-resolution, we offer a theoretical framework to reason about programs and queries such that all derivations are successful. We provide a characterization of those programs and queries which allows to reuse existing methods from the literature on termination and verification of Prolog programs.
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.