Abstract
We present a modal characterization of two well-known nonmonotonic formalisms : the negation as failure rule and default logic. The semantics of logic programming with the negation as failure rule is described through the definition of a modal completion. In modal logic K4, this completion characterizes provability in logic programming with respect to SLDNF-resolution while in modal logic Pr (the modal logic of provability) it characterizes unprovability in logic programs.keywordsnonmonotonic reasoninglogic programmingmodal logic
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.
