Abstract
This article presents some basic aspects of the proof theory of first order logic programming. We start off from general resolution, unit resolution, input resolution and SLD resolution. Then we turn to the sequent calculus and its relationship to resolution and present deductive systems for logic programs (with negation). After discussing partiality in logic programming, this article ends with the introduction of inductive extensions of logic programs, which provide a powerful proof-theoretic framework for logic programming.
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.
