Abstract
An extension of resolution for skeptical stable model semantics is introduced. Unlike previous approaches, our calculus is not derived from credulous inference and enjoys a number of properties that are not satisfied by current nonmonotonic reasoning systems. Skeptical resolution is top down, in general, and goal directed on call-consistent programs. It does not need the given program to be instantiated before reasoning. It may compute nonground answer substitutions efficiently. It is compatible with different implementations of negation as failure. Some inferences, which depend on nonground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals that flounder in the standard setting have a successful skeptical derivation. The paper contains a preliminary study of some interesting derivation strategies and a sketch of a prototype implementation of the calculus.
Sign-in/Register to access full text options 
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.
