Abstract
Depth-first evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs. The paper presents a new semantics for logic programs closing that gap. Although not classical, this semantics, called biquantale semantics, is declarative, since it is based on a notion of validity in a certain class of models. Depth-first evaluation is sound and complete with respect to biquantale semantics. Thus, the computational result is exactly reflected. Complementing the model theoretic semantics by a proof theoretic one, a substructural calculus is presented which is sound and complete with respect to biquantale semantics. Although the main interest is in definite programs, we consider adding a form of negation. Both the model theoretic and the proof theoretic semantics can be generalised to programs with negation.
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.
