Journal of Automated Reasoning

, Volume 27, Issue 4, pp 391–421

Resolution for Skeptical Stable Model Semantics

  • P. A. Bonatti
Article

DOI: 10.1023/A:1011960831261

Cite this article as:
Bonatti, P.A. Journal of Automated Reasoning (2001) 27: 391. doi:10.1023/A:1011960831261

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.

stable semanticsskeptical derivationsresolutionflounderingstrategies

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • P. A. Bonatti
    • 1
  1. 1.Dip. di Tecnologie dell'InformazioneUniversità di MilanoCremaItaly