Abstract

In this paper we study a declarative (fixpoint) semantics for logic programs which correctly models several kinds of partial answers and call patterns. We first show how the Ω-semantics [5,4] can model these observables when the selection rule is not taken into account. We then define a suitable immediate consequence operator, and hence a fixpoint semantics, for partial answers and call patterns which considers also the selection rule. Each observable induces an observational equivalence on programs. The semantics are then related to the observational equivalences by investigating correctness and full abstraction properties.

Full Text
Paper version not known

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 call

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.