A Magic-set Approach to Computing Stable Models on MGTP

Abstract

The stable model semantics is now one of the standard semantics for general logic programs. A simple procedure for computing stable models has been proposed by Inoue et al. [IKH92]. In this paper, we present efficient techniques to compute the stable models of a general logic program. We propose a program transformation based on the magic-sets, which generates models and analyzes negation-as-failure atoms dynamically. We also show experimental results which show remarkable speedup compared with the original procedure. 1 Introduction The stable model semantics [GL88] is now one of the standard semantics for general logic programs. Under the stable model semantics, general logic programs can represent incomplete knowledge, and have interesting applications such as knowledge representation and nonmonotonic reasoning [BG94]. Much work has been done on the semantic issues and applications of the stable models so far, and they have been well investigated. An important research area where re..